./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_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_hash_table_remove_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 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:15:09,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:15:09,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:15:09,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:15:09,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:15:09,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:15:09,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:15:09,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:15:09,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:15:09,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:15:09,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:15:09,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:15:09,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:15:09,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:15:09,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:15:09,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:15:09,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:15:09,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:15:09,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:15:09,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:15:09,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:15:09,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:15:09,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:15:09,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:15:09,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:15:09,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:15:09,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:15:09,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:15:09,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:15:09,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:15:09,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:15:09,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:15:09,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:15:09,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:15:09,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:15:09,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:15:09,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:15:09,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:15:09,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:15:09,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:15:09,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:15:09,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:15:09,814 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:15:09,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:15:09,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:15:09,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:15:09,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:15:09,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:15:09,816 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:15:09,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:15:09,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:15:09,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:15:09,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:15:09,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:15:09,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:15:09,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:15:09,818 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:15:09,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:15:09,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:15:09,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:15:09,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:15:09,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:15:09,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:15:09,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:15:09,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:15:09,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:15:09,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:15:09,820 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:15:09,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:15:09,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:15:09,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:15:09,820 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 -> 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 [2021-11-22 20:15:10,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:15:10,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:15:10,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:15:10,087 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:15:10,088 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:15:10,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-11-22 20:15:10,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8507c6c/60c0fd6b0ff34845a33cae6df21450c1/FLAG51d9a42c1 [2021-11-22 20:15:10,831 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:15:10,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-11-22 20:15:10,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8507c6c/60c0fd6b0ff34845a33cae6df21450c1/FLAG51d9a42c1 [2021-11-22 20:15:10,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8507c6c/60c0fd6b0ff34845a33cae6df21450c1 [2021-11-22 20:15:10,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:15:10,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:15:10,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:15:10,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:15:10,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:15:10,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:15:10" (1/1) ... [2021-11-22 20:15:10,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176421f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:10, skipping insertion in model container [2021-11-22 20:15:10,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:15:10" (1/1) ... [2021-11-22 20:15:10,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:15:11,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:15:11,386 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_hash_table_remove_harness.i[4495,4508] [2021-11-22 20:15:11,396 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_hash_table_remove_harness.i[4555,4568] [2021-11-22 20:15:12,137 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,141 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,141 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,143 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,144 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,154 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,162 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,164 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,165 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,166 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,167 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,168 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,168 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:15:12,473 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:15:12,475 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:15:12,477 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:15:12,478 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:15:12,479 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:15:12,480 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:15:12,480 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:15:12,481 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:15:12,495 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:15:12,687 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:15:12,942 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,943 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,977 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,979 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,985 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:12,986 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,003 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,005 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,005 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,006 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,007 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,007 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,007 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:15:13,092 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:15:13,114 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_hash_table_remove_harness.i[4495,4508] [2021-11-22 20:15:13,114 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_hash_table_remove_harness.i[4555,4568] [2021-11-22 20:15:13,159 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,160 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,160 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,163 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,163 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,171 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,172 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,174 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,174 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,174 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,175 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,217 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:15:13,218 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:15:13,219 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:15:13,219 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:15:13,220 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:15:13,220 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:15:13,220 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:15:13,221 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:15:13,221 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:15:13,221 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:15:13,236 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:15:13,304 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,305 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,310 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,311 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,313 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,313 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,324 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,325 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,325 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,325 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,326 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,326 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,326 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:15:13,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:15:13,537 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:15:13,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13 WrapperNode [2021-11-22 20:15:13,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:15:13,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:15:13,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:15:13,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:15:13,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,806 INFO L137 Inliner]: procedures = 775, calls = 2499, calls flagged for inlining = 764, calls inlined = 155, statements flattened = 2346 [2021-11-22 20:15:13,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:15:13,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:15:13,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:15:13,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:15:13,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:15:13,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:15:13,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:15:13,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:15:13,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (1/1) ... [2021-11-22 20:15:13,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:15:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:15:13,995 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 20:15:14,020 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 20:15:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-22 20:15:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:15:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:15:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:15:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:15:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:15:14,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:15:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:15:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:15:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:15:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:15:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-22 20:15:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:15:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:15:14,433 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:15:14,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:15:15,767 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##298: assume !true; [2021-11-22 20:15:15,768 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##253: assume !true; [2021-11-22 20:15:15,768 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##283: assume !true; [2021-11-22 20:15:15,768 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##215: assume !true; [2021-11-22 20:15:15,768 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume !true; [2021-11-22 20:15:15,768 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##190: assume !true; [2021-11-22 20:15:15,769 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !true; [2021-11-22 20:15:15,769 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:15:15,778 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:15:15,779 INFO L301 CfgBuilder]: Removed 18 assume(true) statements. [2021-11-22 20:15:15,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:15:15 BoogieIcfgContainer [2021-11-22 20:15:15,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:15:15,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:15:15,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:15:15,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:15:15,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:15:10" (1/3) ... [2021-11-22 20:15:15,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb14385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:15:15, skipping insertion in model container [2021-11-22 20:15:15,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:15:13" (2/3) ... [2021-11-22 20:15:15,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb14385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:15:15, skipping insertion in model container [2021-11-22 20:15:15,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:15:15" (3/3) ... [2021-11-22 20:15:15,790 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_remove_harness.i [2021-11-22 20:15:15,795 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:15:15,795 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-11-22 20:15:15,846 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:15:15,861 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 20:15:15,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-11-22 20:15:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 369 states, 347 states have (on average 1.4524495677233429) internal successors, (504), 368 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 20:15:15,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:15,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:15,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash -444167601, now seen corresponding path program 1 times [2021-11-22 20:15:15,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:15,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643648564] [2021-11-22 20:15:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:15,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:16,430 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 20:15:16,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:16,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643648564] [2021-11-22 20:15:16,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643648564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:16,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:16,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:15:16,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238068469] [2021-11-22 20:15:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:15:16,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:15:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:15:16,473 INFO L87 Difference]: Start difference. First operand has 369 states, 347 states have (on average 1.4524495677233429) internal successors, (504), 368 states have internal predecessors, (504), 0 states have call successors, (0), 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 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:16,529 INFO L93 Difference]: Finished difference Result 733 states and 1002 transitions. [2021-11-22 20:15:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:15:16,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-11-22 20:15:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:16,548 INFO L225 Difference]: With dead ends: 733 [2021-11-22 20:15:16,549 INFO L226 Difference]: Without dead ends: 361 [2021-11-22 20:15:16,555 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 20:15:16,561 INFO L933 BasicCegarLoop]: 438 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, 438 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 20:15:16,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-11-22 20:15:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2021-11-22 20:15:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 340 states have (on average 1.261764705882353) internal successors, (429), 360 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 429 transitions. [2021-11-22 20:15:16,632 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 429 transitions. Word has length 76 [2021-11-22 20:15:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:16,632 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 429 transitions. [2021-11-22 20:15:16,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 429 transitions. [2021-11-22 20:15:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 20:15:16,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:16,637 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] [2021-11-22 20:15:16,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:15:16,638 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1410668671, now seen corresponding path program 1 times [2021-11-22 20:15:16,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:16,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321934043] [2021-11-22 20:15:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:16,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:16,749 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:15:16,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001983948] [2021-11-22 20:15:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:16,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:15:16,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:15:16,752 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 20:15:16,781 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 20:15:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:17,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:15:17,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:15:17,630 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 20:15:17,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:15:17,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:17,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321934043] [2021-11-22 20:15:17,631 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:15:17,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001983948] [2021-11-22 20:15:17,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001983948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:17,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:17,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:15:17,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841275756] [2021-11-22 20:15:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:17,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:15:17,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:17,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:15:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:15:17,634 INFO L87 Difference]: Start difference. First operand 361 states and 429 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:17,696 INFO L93 Difference]: Finished difference Result 1049 states and 1248 transitions. [2021-11-22 20:15:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:15:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-11-22 20:15:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:17,699 INFO L225 Difference]: With dead ends: 1049 [2021-11-22 20:15:17,699 INFO L226 Difference]: Without dead ends: 710 [2021-11-22 20:15:17,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:15:17,701 INFO L933 BasicCegarLoop]: 829 mSDtfsCounter, 827 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:17,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 2507 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-11-22 20:15:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 364. [2021-11-22 20:15:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 343 states have (on average 1.2594752186588922) internal successors, (432), 363 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 432 transitions. [2021-11-22 20:15:17,713 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 432 transitions. Word has length 76 [2021-11-22 20:15:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:17,714 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 432 transitions. [2021-11-22 20:15:17,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 432 transitions. [2021-11-22 20:15:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-22 20:15:17,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:17,715 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] [2021-11-22 20:15:17,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 20:15:17,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:15:17,944 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1304316899, now seen corresponding path program 1 times [2021-11-22 20:15:17,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:17,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908306723] [2021-11-22 20:15:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:17,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:15:18,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:18,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908306723] [2021-11-22 20:15:18,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908306723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:18,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:18,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:15:18,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43362727] [2021-11-22 20:15:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:18,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:15:18,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:15:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:15:18,246 INFO L87 Difference]: Start difference. First operand 364 states and 432 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:18,620 INFO L93 Difference]: Finished difference Result 696 states and 827 transitions. [2021-11-22 20:15:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:15:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-22 20:15:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:18,622 INFO L225 Difference]: With dead ends: 696 [2021-11-22 20:15:18,623 INFO L226 Difference]: Without dead ends: 370 [2021-11-22 20:15:18,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:15:18,624 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 891 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:18,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 1891 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:15:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-11-22 20:15:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2021-11-22 20:15:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 345 states have (on average 1.2579710144927536) internal successors, (434), 365 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 434 transitions. [2021-11-22 20:15:18,635 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 434 transitions. Word has length 78 [2021-11-22 20:15:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:18,635 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 434 transitions. [2021-11-22 20:15:18,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 434 transitions. [2021-11-22 20:15:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-22 20:15:18,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:18,637 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] [2021-11-22 20:15:18,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:15:18,637 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1263642149, now seen corresponding path program 1 times [2021-11-22 20:15:18,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:18,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322072800] [2021-11-22 20:15:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:18,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:18,879 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 20:15:18,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:18,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322072800] [2021-11-22 20:15:18,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322072800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:18,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:18,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:15:18,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454564962] [2021-11-22 20:15:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:18,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:15:18,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:15:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:15:18,883 INFO L87 Difference]: Start difference. First operand 366 states and 434 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:18,964 INFO L93 Difference]: Finished difference Result 695 states and 825 transitions. [2021-11-22 20:15:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:15:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-22 20:15:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:18,966 INFO L225 Difference]: With dead ends: 695 [2021-11-22 20:15:18,966 INFO L226 Difference]: Without dead ends: 364 [2021-11-22 20:15:18,967 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 20:15:18,968 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 399 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:18,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 799 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:15:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-22 20:15:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-11-22 20:15:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 343 states have (on average 1.2448979591836735) internal successors, (427), 363 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 427 transitions. [2021-11-22 20:15:18,981 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 427 transitions. Word has length 78 [2021-11-22 20:15:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:18,981 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 427 transitions. [2021-11-22 20:15:18,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 427 transitions. [2021-11-22 20:15:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 20:15:18,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:18,983 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 20:15:18,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:15:18,983 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1290215586, now seen corresponding path program 1 times [2021-11-22 20:15:18,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:18,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729990396] [2021-11-22 20:15:18,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:18,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:19,174 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 20:15:19,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:19,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729990396] [2021-11-22 20:15:19,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729990396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:19,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:19,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:15:19,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860364770] [2021-11-22 20:15:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:19,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:15:19,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:19,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:15:19,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:15:19,177 INFO L87 Difference]: Start difference. First operand 364 states and 427 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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 20:15:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:19,787 INFO L93 Difference]: Finished difference Result 944 states and 1103 transitions. [2021-11-22 20:15:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:15:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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 20:15:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:19,790 INFO L225 Difference]: With dead ends: 944 [2021-11-22 20:15:19,790 INFO L226 Difference]: Without dead ends: 617 [2021-11-22 20:15:19,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:15:19,791 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 404 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:19,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 2051 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 20:15:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-11-22 20:15:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 364. [2021-11-22 20:15:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 343 states have (on average 1.227405247813411) internal successors, (421), 363 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 421 transitions. [2021-11-22 20:15:19,806 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 421 transitions. Word has length 80 [2021-11-22 20:15:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:19,807 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 421 transitions. [2021-11-22 20:15:19,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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 20:15:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 421 transitions. [2021-11-22 20:15:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 20:15:19,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:19,808 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] [2021-11-22 20:15:19,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:15:19,809 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash -519210159, now seen corresponding path program 1 times [2021-11-22 20:15:19,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:19,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293410309] [2021-11-22 20:15:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:19,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:20,088 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 20:15:20,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293410309] [2021-11-22 20:15:20,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293410309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:20,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:20,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:15:20,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554857570] [2021-11-22 20:15:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:20,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:15:20,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:15:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:15:20,091 INFO L87 Difference]: Start difference. First operand 364 states and 421 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:20,320 INFO L93 Difference]: Finished difference Result 770 states and 895 transitions. [2021-11-22 20:15:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:15:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 20:15:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:20,324 INFO L225 Difference]: With dead ends: 770 [2021-11-22 20:15:20,324 INFO L226 Difference]: Without dead ends: 489 [2021-11-22 20:15:20,324 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 20:15:20,325 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 146 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:20,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1343 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:15:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-11-22 20:15:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 364. [2021-11-22 20:15:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 343 states have (on average 1.2128279883381925) internal successors, (416), 363 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 416 transitions. [2021-11-22 20:15:20,339 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 416 transitions. Word has length 81 [2021-11-22 20:15:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:20,340 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 416 transitions. [2021-11-22 20:15:20,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 416 transitions. [2021-11-22 20:15:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 20:15:20,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:20,341 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] [2021-11-22 20:15:20,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:15:20,342 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1923016076, now seen corresponding path program 1 times [2021-11-22 20:15:20,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:20,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061398847] [2021-11-22 20:15:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:20,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:20,689 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 20:15:20,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:20,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061398847] [2021-11-22 20:15:20,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061398847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:20,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:20,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:15:20,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836854184] [2021-11-22 20:15:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:20,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:15:20,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:15:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:15:20,694 INFO L87 Difference]: Start difference. First operand 364 states and 416 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:21,472 INFO L93 Difference]: Finished difference Result 1007 states and 1157 transitions. [2021-11-22 20:15:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 20:15:21,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-22 20:15:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:21,477 INFO L225 Difference]: With dead ends: 1007 [2021-11-22 20:15:21,477 INFO L226 Difference]: Without dead ends: 698 [2021-11-22 20:15:21,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:15:21,479 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 1307 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:21,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1307 Valid, 2026 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 20:15:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-11-22 20:15:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 364. [2021-11-22 20:15:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 343 states have (on average 1.2099125364431487) internal successors, (415), 363 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 415 transitions. [2021-11-22 20:15:21,498 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 415 transitions. Word has length 82 [2021-11-22 20:15:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:21,499 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 415 transitions. [2021-11-22 20:15:21,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 415 transitions. [2021-11-22 20:15:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 20:15:21,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:21,500 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] [2021-11-22 20:15:21,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:15:21,500 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:21,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1205302351, now seen corresponding path program 1 times [2021-11-22 20:15:21,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:21,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473623212] [2021-11-22 20:15:21,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:21,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:21,832 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 20:15:21,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:21,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473623212] [2021-11-22 20:15:21,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473623212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:21,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:21,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:15:21,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386805038] [2021-11-22 20:15:21,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:21,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:15:21,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:15:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:15:21,835 INFO L87 Difference]: Start difference. First operand 364 states and 415 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:22,502 INFO L93 Difference]: Finished difference Result 903 states and 1030 transitions. [2021-11-22 20:15:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:15:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 20:15:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:22,505 INFO L225 Difference]: With dead ends: 903 [2021-11-22 20:15:22,505 INFO L226 Difference]: Without dead ends: 620 [2021-11-22 20:15:22,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:15:22,506 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 818 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:22,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [818 Valid, 1793 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 20:15:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-11-22 20:15:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 364. [2021-11-22 20:15:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 343 states have (on average 1.206997084548105) internal successors, (414), 363 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 414 transitions. [2021-11-22 20:15:22,525 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 414 transitions. Word has length 85 [2021-11-22 20:15:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:22,526 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 414 transitions. [2021-11-22 20:15:22,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 414 transitions. [2021-11-22 20:15:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 20:15:22,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:22,527 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 20:15:22,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:15:22,527 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1940746953, now seen corresponding path program 1 times [2021-11-22 20:15:22,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:22,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099583967] [2021-11-22 20:15:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:22,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:23,158 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 20:15:23,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099583967] [2021-11-22 20:15:23,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099583967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:23,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:23,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:15:23,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134975127] [2021-11-22 20:15:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:23,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:15:23,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:15:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:15:23,162 INFO L87 Difference]: Start difference. First operand 364 states and 414 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 20:15:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:23,233 INFO L93 Difference]: Finished difference Result 364 states and 414 transitions. [2021-11-22 20:15:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:15:23,234 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 20:15:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:23,235 INFO L225 Difference]: With dead ends: 364 [2021-11-22 20:15:23,235 INFO L226 Difference]: Without dead ends: 362 [2021-11-22 20:15:23,236 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 20:15:23,238 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 7 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:23,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 751 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-22 20:15:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-11-22 20:15:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 342 states have (on average 1.2046783625730995) internal successors, (412), 361 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 412 transitions. [2021-11-22 20:15:23,255 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 412 transitions. Word has length 88 [2021-11-22 20:15:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:23,256 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 412 transitions. [2021-11-22 20:15:23,256 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 20:15:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 412 transitions. [2021-11-22 20:15:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-22 20:15:23,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:23,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:23,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:15:23,260 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1474626213, now seen corresponding path program 1 times [2021-11-22 20:15:23,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:23,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334887998] [2021-11-22 20:15:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:23,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:23,719 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 20:15:23,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:23,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334887998] [2021-11-22 20:15:23,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334887998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:23,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:23,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:15:23,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118134137] [2021-11-22 20:15:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:23,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:15:23,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:15:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:15:23,721 INFO L87 Difference]: Start difference. First operand 362 states and 412 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:23,887 INFO L93 Difference]: Finished difference Result 695 states and 806 transitions. [2021-11-22 20:15:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:15:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-11-22 20:15:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:23,891 INFO L225 Difference]: With dead ends: 695 [2021-11-22 20:15:23,891 INFO L226 Difference]: Without dead ends: 693 [2021-11-22 20:15:23,891 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 20:15:23,892 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 508 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:23,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 1665 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:15:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-11-22 20:15:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 364. [2021-11-22 20:15:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 344 states have (on average 1.2034883720930232) internal successors, (414), 363 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 414 transitions. [2021-11-22 20:15:23,913 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 414 transitions. Word has length 95 [2021-11-22 20:15:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:23,913 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 414 transitions. [2021-11-22 20:15:23,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 414 transitions. [2021-11-22 20:15:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-22 20:15:23,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:23,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:15:23,915 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1474566631, now seen corresponding path program 1 times [2021-11-22 20:15:23,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:23,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996317320] [2021-11-22 20:15:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:23,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:24,971 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 20:15:24,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:24,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996317320] [2021-11-22 20:15:24,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996317320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:24,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:24,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:15:24,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088818661] [2021-11-22 20:15:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:24,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:15:24,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:15:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:15:24,974 INFO L87 Difference]: Start difference. First operand 364 states and 414 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:25,159 INFO L93 Difference]: Finished difference Result 692 states and 803 transitions. [2021-11-22 20:15:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:15:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-11-22 20:15:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:25,162 INFO L225 Difference]: With dead ends: 692 [2021-11-22 20:15:25,163 INFO L226 Difference]: Without dead ends: 690 [2021-11-22 20:15:25,163 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 20:15:25,164 INFO L933 BasicCegarLoop]: 698 mSDtfsCounter, 508 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:25,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 1658 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:15:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-11-22 20:15:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 360. [2021-11-22 20:15:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 341 states have (on average 1.2023460410557185) internal successors, (410), 359 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 410 transitions. [2021-11-22 20:15:25,191 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 410 transitions. Word has length 95 [2021-11-22 20:15:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:25,191 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 410 transitions. [2021-11-22 20:15:25,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 410 transitions. [2021-11-22 20:15:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 20:15:25,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:25,192 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] [2021-11-22 20:15:25,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:15:25,193 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 852256710, now seen corresponding path program 1 times [2021-11-22 20:15:25,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:25,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945441255] [2021-11-22 20:15:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:25,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:15:25,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:25,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945441255] [2021-11-22 20:15:25,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945441255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:25,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:25,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:15:25,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138706038] [2021-11-22 20:15:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:25,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:15:25,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:25,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:15:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:15:25,510 INFO L87 Difference]: Start difference. First operand 360 states and 410 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:25,583 INFO L93 Difference]: Finished difference Result 899 states and 1030 transitions. [2021-11-22 20:15:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:15:25,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 20:15:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:25,586 INFO L225 Difference]: With dead ends: 899 [2021-11-22 20:15:25,586 INFO L226 Difference]: Without dead ends: 646 [2021-11-22 20:15:25,587 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 20:15:25,587 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 1238 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:25,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1238 Valid, 1253 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-11-22 20:15:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 393. [2021-11-22 20:15:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 374 states have (on average 1.1898395721925135) internal successors, (445), 392 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 445 transitions. [2021-11-22 20:15:25,613 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 445 transitions. Word has length 101 [2021-11-22 20:15:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:25,613 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 445 transitions. [2021-11-22 20:15:25,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 445 transitions. [2021-11-22 20:15:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 20:15:25,614 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:25,614 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] [2021-11-22 20:15:25,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:15:25,615 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:25,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash -158860540, now seen corresponding path program 1 times [2021-11-22 20:15:25,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158948719] [2021-11-22 20:15:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:25,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:25,902 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 20:15:25,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:25,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158948719] [2021-11-22 20:15:25,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158948719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:25,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:25,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:15:25,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770200611] [2021-11-22 20:15:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:25,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:15:25,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:15:25,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:15:25,904 INFO L87 Difference]: Start difference. First operand 393 states and 445 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:26,085 INFO L93 Difference]: Finished difference Result 1005 states and 1155 transitions. [2021-11-22 20:15:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:15:26,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 20:15:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:26,088 INFO L225 Difference]: With dead ends: 1005 [2021-11-22 20:15:26,088 INFO L226 Difference]: Without dead ends: 764 [2021-11-22 20:15:26,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:15:26,090 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 1442 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:26,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1442 Valid, 2263 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-11-22 20:15:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 407. [2021-11-22 20:15:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 388 states have (on average 1.193298969072165) internal successors, (463), 406 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 463 transitions. [2021-11-22 20:15:26,125 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 463 transitions. Word has length 101 [2021-11-22 20:15:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:26,125 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 463 transitions. [2021-11-22 20:15:26,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 463 transitions. [2021-11-22 20:15:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 20:15:26,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:26,127 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] [2021-11-22 20:15:26,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:15:26,128 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash -612010601, now seen corresponding path program 1 times [2021-11-22 20:15:26,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:26,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405684398] [2021-11-22 20:15:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:26,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:26,400 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 20:15:26,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:26,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405684398] [2021-11-22 20:15:26,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405684398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:26,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:26,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:15:26,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118299080] [2021-11-22 20:15:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:26,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:15:26,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:15:26,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:15:26,403 INFO L87 Difference]: Start difference. First operand 407 states and 463 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:26,437 INFO L93 Difference]: Finished difference Result 541 states and 616 transitions. [2021-11-22 20:15:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:15:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-22 20:15:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:26,439 INFO L225 Difference]: With dead ends: 541 [2021-11-22 20:15:26,440 INFO L226 Difference]: Without dead ends: 407 [2021-11-22 20:15:26,440 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 20:15:26,441 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:26,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 517 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-11-22 20:15:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2021-11-22 20:15:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 388 states have (on average 1.1881443298969072) internal successors, (461), 406 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 461 transitions. [2021-11-22 20:15:26,472 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 461 transitions. Word has length 102 [2021-11-22 20:15:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:26,472 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 461 transitions. [2021-11-22 20:15:26,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 461 transitions. [2021-11-22 20:15:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 20:15:26,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:26,474 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] [2021-11-22 20:15:26,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 20:15:26,475 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -353845163, now seen corresponding path program 1 times [2021-11-22 20:15:26,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:26,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320802598] [2021-11-22 20:15:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:26,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:28,976 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 20:15:28,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:28,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320802598] [2021-11-22 20:15:28,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320802598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:28,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:28,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-22 20:15:28,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197786639] [2021-11-22 20:15:28,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:28,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-22 20:15:28,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:28,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-22 20:15:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2021-11-22 20:15:28,979 INFO L87 Difference]: Start difference. First operand 407 states and 461 transitions. Second operand has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:36,040 INFO L93 Difference]: Finished difference Result 732 states and 829 transitions. [2021-11-22 20:15:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-22 20:15:36,041 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-22 20:15:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:36,043 INFO L225 Difference]: With dead ends: 732 [2021-11-22 20:15:36,044 INFO L226 Difference]: Without dead ends: 679 [2021-11-22 20:15:36,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=859, Invalid=4543, Unknown=0, NotChecked=0, Total=5402 [2021-11-22 20:15:36,046 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 4206 mSDsluCounter, 4606 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:36,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4206 Valid, 4957 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-22 20:15:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-11-22 20:15:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 473. [2021-11-22 20:15:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 454 states have (on average 1.2004405286343611) internal successors, (545), 472 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 545 transitions. [2021-11-22 20:15:36,101 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 545 transitions. Word has length 102 [2021-11-22 20:15:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:36,101 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 545 transitions. [2021-11-22 20:15:36,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 545 transitions. [2021-11-22 20:15:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 20:15:36,103 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:36,103 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] [2021-11-22 20:15:36,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 20:15:36,104 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:36,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1421162199, now seen corresponding path program 1 times [2021-11-22 20:15:36,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:36,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819479545] [2021-11-22 20:15:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:36,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:36,421 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 20:15:36,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819479545] [2021-11-22 20:15:36,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819479545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:36,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:36,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:15:36,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712398504] [2021-11-22 20:15:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:36,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:15:36,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:15:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:15:36,423 INFO L87 Difference]: Start difference. First operand 473 states and 545 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:36,539 INFO L93 Difference]: Finished difference Result 542 states and 620 transitions. [2021-11-22 20:15:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:15:36,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-22 20:15:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:36,542 INFO L225 Difference]: With dead ends: 542 [2021-11-22 20:15:36,542 INFO L226 Difference]: Without dead ends: 473 [2021-11-22 20:15:36,543 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 20:15:36,543 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 626 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:36,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 824 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:15:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-22 20:15:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-11-22 20:15:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 454 states have (on average 1.1938325991189427) internal successors, (542), 472 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 542 transitions. [2021-11-22 20:15:36,588 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 542 transitions. Word has length 102 [2021-11-22 20:15:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:36,588 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 542 transitions. [2021-11-22 20:15:36,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 542 transitions. [2021-11-22 20:15:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 20:15:36,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:36,590 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] [2021-11-22 20:15:36,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 20:15:36,590 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash -919348651, now seen corresponding path program 1 times [2021-11-22 20:15:36,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:36,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137518860] [2021-11-22 20:15:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:36,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:38,574 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 20:15:38,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137518860] [2021-11-22 20:15:38,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137518860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:38,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:38,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-22 20:15:38,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929008324] [2021-11-22 20:15:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:38,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-22 20:15:38,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-22 20:15:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-11-22 20:15:38,577 INFO L87 Difference]: Start difference. First operand 473 states and 542 transitions. Second operand has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:41,059 INFO L93 Difference]: Finished difference Result 737 states and 840 transitions. [2021-11-22 20:15:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 20:15:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-22 20:15:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:41,063 INFO L225 Difference]: With dead ends: 737 [2021-11-22 20:15:41,064 INFO L226 Difference]: Without dead ends: 684 [2021-11-22 20:15:41,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=1991, Unknown=0, NotChecked=0, Total=2352 [2021-11-22 20:15:41,065 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 2189 mSDsluCounter, 5433 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 5974 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:41,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2189 Valid, 5974 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 20:15:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-11-22 20:15:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 473. [2021-11-22 20:15:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 454 states have (on average 1.1938325991189427) internal successors, (542), 472 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 542 transitions. [2021-11-22 20:15:41,111 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 542 transitions. Word has length 102 [2021-11-22 20:15:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:41,111 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 542 transitions. [2021-11-22 20:15:41,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 542 transitions. [2021-11-22 20:15:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 20:15:41,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:41,113 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] [2021-11-22 20:15:41,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 20:15:41,113 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2095754967, now seen corresponding path program 1 times [2021-11-22 20:15:41,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:41,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512294385] [2021-11-22 20:15:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:41,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:41,363 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 20:15:41,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:41,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512294385] [2021-11-22 20:15:41,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512294385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:41,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:41,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:15:41,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235650685] [2021-11-22 20:15:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:41,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:15:41,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:15:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:15:41,366 INFO L87 Difference]: Start difference. First operand 473 states and 542 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:41,450 INFO L93 Difference]: Finished difference Result 899 states and 1025 transitions. [2021-11-22 20:15:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:15:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-22 20:15:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:41,453 INFO L225 Difference]: With dead ends: 899 [2021-11-22 20:15:41,453 INFO L226 Difference]: Without dead ends: 636 [2021-11-22 20:15:41,456 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 20:15:41,457 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 282 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:41,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 1702 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:15:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-11-22 20:15:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 413. [2021-11-22 20:15:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 394 states have (on average 1.1776649746192893) internal successors, (464), 412 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 464 transitions. [2021-11-22 20:15:41,497 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 464 transitions. Word has length 102 [2021-11-22 20:15:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:41,498 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 464 transitions. [2021-11-22 20:15:41,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 464 transitions. [2021-11-22 20:15:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-22 20:15:41,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:41,499 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] [2021-11-22 20:15:41,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 20:15:41,500 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1480321235, now seen corresponding path program 1 times [2021-11-22 20:15:41,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682496029] [2021-11-22 20:15:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:41,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:42,122 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 20:15:42,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682496029] [2021-11-22 20:15:42,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682496029] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:42,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:42,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 20:15:42,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396902433] [2021-11-22 20:15:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:42,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:15:42,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:15:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:15:42,125 INFO L87 Difference]: Start difference. First operand 413 states and 464 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:43,746 INFO L93 Difference]: Finished difference Result 1121 states and 1271 transitions. [2021-11-22 20:15:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 20:15:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-22 20:15:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:43,751 INFO L225 Difference]: With dead ends: 1121 [2021-11-22 20:15:43,751 INFO L226 Difference]: Without dead ends: 913 [2021-11-22 20:15:43,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2021-11-22 20:15:43,753 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 2573 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 3787 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:43,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2573 Valid, 3787 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 20:15:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-11-22 20:15:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 413. [2021-11-22 20:15:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 394 states have (on average 1.1751269035532994) internal successors, (463), 412 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 463 transitions. [2021-11-22 20:15:43,802 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 463 transitions. Word has length 103 [2021-11-22 20:15:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:43,802 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 463 transitions. [2021-11-22 20:15:43,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 463 transitions. [2021-11-22 20:15:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 20:15:43,804 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:43,804 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] [2021-11-22 20:15:43,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 20:15:43,804 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1356467000, now seen corresponding path program 1 times [2021-11-22 20:15:43,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:43,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148163760] [2021-11-22 20:15:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:43,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:15:46,027 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 20:15:46,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:15:46,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148163760] [2021-11-22 20:15:46,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148163760] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:15:46,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:15:46,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:15:46,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095057462] [2021-11-22 20:15:46,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:15:46,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:15:46,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:15:46,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:15:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:15:46,030 INFO L87 Difference]: Start difference. First operand 413 states and 463 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:15:46,162 INFO L93 Difference]: Finished difference Result 801 states and 897 transitions. [2021-11-22 20:15:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:15:46,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2021-11-22 20:15:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:15:46,164 INFO L225 Difference]: With dead ends: 801 [2021-11-22 20:15:46,164 INFO L226 Difference]: Without dead ends: 413 [2021-11-22 20:15:46,165 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 20:15:46,166 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:15:46,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1138 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:15:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-22 20:15:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2021-11-22 20:15:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 391 states have (on average 1.1713554987212276) internal successors, (458), 409 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 458 transitions. [2021-11-22 20:15:46,213 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 458 transitions. Word has length 104 [2021-11-22 20:15:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:15:46,214 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 458 transitions. [2021-11-22 20:15:46,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:15:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 458 transitions. [2021-11-22 20:15:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 20:15:46,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:15:46,215 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] [2021-11-22 20:15:46,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 20:15:46,216 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:15:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:15:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash -77836405, now seen corresponding path program 1 times [2021-11-22 20:15:46,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:15:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080311964] [2021-11-22 20:15:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:46,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:15:46,313 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:15:46,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661911985] [2021-11-22 20:15:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:15:46,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:15:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:15:46,319 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 20:15:46,321 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 20:16:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:16:29,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 3208 conjuncts, 481 conjunts are in the unsatisfiable core [2021-11-22 20:16:29,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:16:29,785 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 20:16:30,133 INFO L354 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2021-11-22 20:16:30,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2021-11-22 20:16:30,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:16:30,726 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-22 20:16:30,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-11-22 20:16:30,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-22 20:16:31,177 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-22 20:16:31,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 51 [2021-11-22 20:16:31,794 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 20:16:31,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:16:31,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:16:31,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080311964] [2021-11-22 20:16:31,795 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:16:31,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661911985] [2021-11-22 20:16:31,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661911985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:16:31,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:16:31,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:16:31,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394632735] [2021-11-22 20:16:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:16:31,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:16:31,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:16:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:16:31,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:16:31,800 INFO L87 Difference]: Start difference. First operand 410 states and 458 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:16:32,547 INFO L93 Difference]: Finished difference Result 811 states and 906 transitions. [2021-11-22 20:16:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:16:32,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-22 20:16:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:16:32,549 INFO L225 Difference]: With dead ends: 811 [2021-11-22 20:16:32,549 INFO L226 Difference]: Without dead ends: 420 [2021-11-22 20:16:32,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-22 20:16:32,550 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 97 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:16:32,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1501 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2021-11-22 20:16:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-11-22 20:16:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 415. [2021-11-22 20:16:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 396 states have (on average 1.1691919191919191) internal successors, (463), 414 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 463 transitions. [2021-11-22 20:16:32,603 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 463 transitions. Word has length 107 [2021-11-22 20:16:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:16:32,604 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 463 transitions. [2021-11-22 20:16:32,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 463 transitions. [2021-11-22 20:16:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 20:16:32,605 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:16:32,605 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] [2021-11-22 20:16:32,693 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 20:16:32,806 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,SelfDestructingSolverStorable20 [2021-11-22 20:16:32,806 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:16:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:16:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash 445837167, now seen corresponding path program 1 times [2021-11-22 20:16:32,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:16:32,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476565688] [2021-11-22 20:16:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:16:32,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:16:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:16:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:16:33,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:16:33,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476565688] [2021-11-22 20:16:33,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476565688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:16:33,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:16:33,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:16:33,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645537529] [2021-11-22 20:16:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:16:33,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:16:33,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:16:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:16:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:16:33,022 INFO L87 Difference]: Start difference. First operand 415 states and 463 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:16:33,116 INFO L93 Difference]: Finished difference Result 808 states and 902 transitions. [2021-11-22 20:16:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:16:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-22 20:16:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:16:33,118 INFO L225 Difference]: With dead ends: 808 [2021-11-22 20:16:33,118 INFO L226 Difference]: Without dead ends: 408 [2021-11-22 20:16:33,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:16:33,120 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 386 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:16:33,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 1593 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:16:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-22 20:16:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2021-11-22 20:16:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 389 states have (on average 1.167095115681234) internal successors, (454), 407 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 454 transitions. [2021-11-22 20:16:33,173 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 454 transitions. Word has length 109 [2021-11-22 20:16:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:16:33,173 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 454 transitions. [2021-11-22 20:16:33,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 454 transitions. [2021-11-22 20:16:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 20:16:33,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:16:33,176 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] [2021-11-22 20:16:33,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 20:16:33,176 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-22 20:16:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:16:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1336997479, now seen corresponding path program 1 times [2021-11-22 20:16:33,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:16:33,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851174151] [2021-11-22 20:16:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:16:33,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:16:33,245 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:16:33,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66000315] [2021-11-22 20:16:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:16:33,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:16:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:16:33,248 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 20:16:33,249 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 20:16:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:16:34,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 3205 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 20:16:34,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:16:34,330 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 20:16:34,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:16:34,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:16:34,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851174151] [2021-11-22 20:16:34,331 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:16:34,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66000315] [2021-11-22 20:16:34,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66000315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:16:34,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:16:34,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:16:34,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294170914] [2021-11-22 20:16:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:16:34,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:16:34,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:16:34,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:16:34,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:16:34,332 INFO L87 Difference]: Start difference. First operand 408 states and 454 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:16:34,364 INFO L93 Difference]: Finished difference Result 408 states and 454 transitions. [2021-11-22 20:16:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:16:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-22 20:16:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:16:34,364 INFO L225 Difference]: With dead ends: 408 [2021-11-22 20:16:34,364 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 20:16:34,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:16:34,366 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:16:34,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:16:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 20:16:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 20:16:34,367 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 20:16:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 20:16:34,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2021-11-22 20:16:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:16:34,367 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 20:16:34,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:16:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 20:16:34,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 20:16:34,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 21 remaining) [2021-11-22 20:16:34,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (19 of 21 remaining) [2021-11-22 20:16:34,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (18 of 21 remaining) [2021-11-22 20:16:34,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 21 remaining) [2021-11-22 20:16:34,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 21 remaining) [2021-11-22 20:16:34,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (15 of 21 remaining) [2021-11-22 20:16:34,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (14 of 21 remaining) [2021-11-22 20:16:34,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (13 of 21 remaining) [2021-11-22 20:16:34,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 21 remaining) [2021-11-22 20:16:34,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (11 of 21 remaining) [2021-11-22 20:16:34,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 21 remaining) [2021-11-22 20:16:34,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (9 of 21 remaining) [2021-11-22 20:16:34,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (8 of 21 remaining) [2021-11-22 20:16:34,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (7 of 21 remaining) [2021-11-22 20:16:34,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (6 of 21 remaining) [2021-11-22 20:16:34,373 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (5 of 21 remaining) [2021-11-22 20:16:34,373 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (4 of 21 remaining) [2021-11-22 20:16:34,373 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (3 of 21 remaining) [2021-11-22 20:16:34,373 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (2 of 21 remaining) [2021-11-22 20:16:34,373 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (1 of 21 remaining) [2021-11-22 20:16:34,373 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (0 of 21 remaining) [2021-11-22 20:16:34,405 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 20:16:34,599 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 20:16:34,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 20:16:36,094 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,094 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,094 INFO L858 garLoopResultBuilder]: For program point L9682(lines 9682 9684) no Hoare annotation was computed. [2021-11-22 20:16:36,094 INFO L858 garLoopResultBuilder]: For program point L9682-2(lines 9682 9684) no Hoare annotation was computed. [2021-11-22 20:16:36,094 INFO L854 garLoopResultBuilder]: At program point L9154-5(line 9154) the Hoare annotation is: false [2021-11-22 20:16:36,094 INFO L854 garLoopResultBuilder]: At program point L9154-2(line 9154) the Hoare annotation is: false [2021-11-22 20:16:36,094 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238-1(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238-2(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238-3(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L7373(lines 7369 7374) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238-4(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L9157(lines 9157 9161) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238-5(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L238-6(line 238) the Hoare annotation is: false [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24)) (.cse1 (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (.cse2 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|)) (.cse4 (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4)) (.cse6 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|)) (.cse9 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse10 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse11 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse12 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) (.cse13 (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) (.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse15 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1)) (.cse16 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse17 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0)) (.cse18 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) (.cse19 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res#1| 1) 0) .cse17 .cse18 .cse19) (let ((.cse20 (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (let ((.cse21 (select .cse20 0))) (and .cse0 .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) .cse2 .cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select .cse20 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse13 (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) .cse21) .cse14 (= |ULTIMATE.start_aws_add_u64_checked_~a#1| .cse21) .cse15 .cse16 .cse17 (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) .cse18 .cse19))))) [2021-11-22 20:16:36,095 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L239-1(line 239) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L239-2(line 239) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L239-3(line 239) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L239-4(line 239) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L239-5(line 239) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L9621(lines 9621 9659) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L9160-3(line 9160) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L854 garLoopResultBuilder]: At program point L9160-5(line 9160) the Hoare annotation is: false [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-1(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L9160-1(line 9160) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-6(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-7(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-8(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-9(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-2(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,096 INFO L858 garLoopResultBuilder]: For program point L10019-3(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-4(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-5(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-14(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-10(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-11(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-12(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L10019-13(lines 10019 10023) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L9690(lines 9690 9693) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L9690-1(lines 9690 9693) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L9624(line 9624) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point L9624-2(line 9624) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,097 INFO L854 garLoopResultBuilder]: At program point L9692-2(line 9692) the Hoare annotation is: false [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L6852-1(line 6852) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L854 garLoopResultBuilder]: At program point L9100(lines 9100 9116) the Hoare annotation is: false [2021-11-22 20:16:36,098 INFO L854 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: false [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L9697(lines 9697 9706) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select .cse0 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_add_u64_checked_~a#1| (select .cse0 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0) (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)))) [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L858 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2021-11-22 20:16:36,098 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) [2021-11-22 20:16:36,098 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,098 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-8(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-7(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,099 INFO L854 garLoopResultBuilder]: At program point L2630-10(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2630-9(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2630-12(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2630-11(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2630-14(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2630-13(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2630-15(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L858 garLoopResultBuilder]: For program point L9700(lines 9700 9702) no Hoare annotation was computed. [2021-11-22 20:16:36,100 INFO L858 garLoopResultBuilder]: For program point L9700-2(lines 9700 9702) no Hoare annotation was computed. [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L9635-2(lines 9635 9654) the Hoare annotation is: false [2021-11-22 20:16:36,100 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24)) (.cse1 (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (.cse2 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|)) (.cse4 (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4)) (.cse6 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|)) (.cse9 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse10 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse11 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse12 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse13 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) (.cse14 (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) (.cse15 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse16 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse18 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0)) (.cse19 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) (.cse20 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-22 20:16:36,101 INFO L858 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2021-11-22 20:16:36,101 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) [2021-11-22 20:16:36,101 INFO L858 garLoopResultBuilder]: For program point L10165(lines 10165 10166) no Hoare annotation was computed. [2021-11-22 20:16:36,101 INFO L858 garLoopResultBuilder]: For program point L10165-2(lines 10165 10169) no Hoare annotation was computed. [2021-11-22 20:16:36,101 INFO L858 garLoopResultBuilder]: For program point L9703-2(lines 9697 9706) no Hoare annotation was computed. [2021-11-22 20:16:36,101 INFO L858 garLoopResultBuilder]: For program point L9703(lines 9703 9705) no Hoare annotation was computed. [2021-11-22 20:16:36,101 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L10167-1(lines 10167 10168) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L9639(lines 9639 9641) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L9377-2(lines 9377 9380) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: false [2021-11-22 20:16:36,102 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L10171(lines 10171 10185) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L10171-1(lines 10171 10185) no Hoare annotation was computed. [2021-11-22 20:16:36,102 INFO L854 garLoopResultBuilder]: At program point L9709-2(line 9709) the Hoare annotation is: false [2021-11-22 20:16:36,102 INFO L858 garLoopResultBuilder]: For program point L9709-3(line 9709) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L262-1(line 262) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L10172(lines 10172 10178) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L9115-1(lines 9100 9116) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L10172-2(lines 10172 10178) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L-1-5(line -1) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L-1-8(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L-1-9(line -1) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L-1-10(line -1) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L854 garLoopResultBuilder]: At program point L-1-11(line -1) the Hoare annotation is: false [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L10175-2(line 10175) no Hoare annotation was computed. [2021-11-22 20:16:36,103 INFO L858 garLoopResultBuilder]: For program point L10175(line 10175) no Hoare annotation was computed. [2021-11-22 20:16:36,104 INFO L858 garLoopResultBuilder]: For program point L9647(lines 9647 9649) no Hoare annotation was computed. [2021-11-22 20:16:36,104 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0)) [2021-11-22 20:16:36,104 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-22 20:16:36,104 INFO L854 garLoopResultBuilder]: At program point L7402(lines 7399 7403) the Hoare annotation is: false [2021-11-22 20:16:36,104 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,104 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-22 20:16:36,104 INFO L858 garLoopResultBuilder]: For program point L10180(line 10180) no Hoare annotation was computed. [2021-11-22 20:16:36,104 INFO L858 garLoopResultBuilder]: For program point L10180-2(lines 10180 10182) no Hoare annotation was computed. [2021-11-22 20:16:36,104 INFO L854 garLoopResultBuilder]: At program point L7406(lines 7405 7407) the Hoare annotation is: false [2021-11-22 20:16:36,104 INFO L858 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L7341-3(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L9125-1(lines 9125 9129) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L7341-6(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L7341-5(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point L7341-8(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,105 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: false [2021-11-22 20:16:36,106 INFO L854 garLoopResultBuilder]: At program point L7344-2(lines 7331 7345) the Hoare annotation is: false [2021-11-22 20:16:36,106 INFO L854 garLoopResultBuilder]: At program point L7344-1(lines 7331 7345) the Hoare annotation is: false [2021-11-22 20:16:36,106 INFO L854 garLoopResultBuilder]: At program point L7344(lines 7331 7345) the Hoare annotation is: false [2021-11-22 20:16:36,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,106 INFO L858 garLoopResultBuilder]: For program point L9657(line 9657) no Hoare annotation was computed. [2021-11-22 20:16:36,106 INFO L858 garLoopResultBuilder]: For program point L9657-1(lines 9621 9659) no Hoare annotation was computed. [2021-11-22 20:16:36,106 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,107 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,108 INFO L858 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-15(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-16(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-17(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-18(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-19(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-20(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L9658(line 9658) no Hoare annotation was computed. [2021-11-22 20:16:36,109 INFO L858 garLoopResultBuilder]: For program point L210-21(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-22(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-23(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-24(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-25(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-26(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-27(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-28(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,110 INFO L858 garLoopResultBuilder]: For program point L210-29(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L9658-2(line 9658) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L210-30(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L9658-4(lines 9621 9659) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,111 INFO L861 garLoopResultBuilder]: At program point L10187(line 10187) the Hoare annotation is: true [2021-11-22 20:16:36,111 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,112 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24)) (.cse1 (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (.cse2 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|)) (.cse4 (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4)) (.cse6 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|)) (.cse9 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse10 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse11 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse12 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse13 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) (.cse14 (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) (.cse15 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse16 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse18 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0)) (.cse19 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) (.cse20 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res#1| 1) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-30(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-32(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,113 INFO L858 garLoopResultBuilder]: For program point L211-34(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L211-36(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L10122(lines 10122 10124) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L9131-1(lines 9131 9139) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L211-38(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L211-40(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,114 INFO L858 garLoopResultBuilder]: For program point L211-42(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L854 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: false [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-44(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-46(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-48(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-50(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-52(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-54(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,115 INFO L858 garLoopResultBuilder]: For program point L211-56(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,116 INFO L858 garLoopResultBuilder]: For program point L211-58(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,116 INFO L858 garLoopResultBuilder]: For program point L211-60(line 211) no Hoare annotation was computed. [2021-11-22 20:16:36,116 INFO L858 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2021-11-22 20:16:36,116 INFO L858 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2021-11-22 20:16:36,116 INFO L854 garLoopResultBuilder]: At program point L9661(lines 9661 9710) the Hoare annotation is: false [2021-11-22 20:16:36,116 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) [2021-11-22 20:16:36,117 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) [2021-11-22 20:16:36,117 INFO L858 garLoopResultBuilder]: For program point L10126(lines 10126 10128) no Hoare annotation was computed. [2021-11-22 20:16:36,117 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,117 INFO L854 garLoopResultBuilder]: At program point L7287-1(lines 7280 7288) the Hoare annotation is: false [2021-11-22 20:16:36,117 INFO L854 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: false [2021-11-22 20:16:36,117 INFO L854 garLoopResultBuilder]: At program point L10062-1(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,117 INFO L854 garLoopResultBuilder]: At program point L10062-2(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062-3(lines 10017 10064) the Hoare annotation is: (and (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062-4(lines 10017 10064) the Hoare annotation is: (and (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062-9(lines 10017 10064) the Hoare annotation is: (and (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062-10(lines 10017 10064) the Hoare annotation is: (and (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062-11(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,118 INFO L854 garLoopResultBuilder]: At program point L10062-12(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,119 INFO L854 garLoopResultBuilder]: At program point L10062-5(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,119 INFO L854 garLoopResultBuilder]: At program point L10062-6(lines 10017 10064) the Hoare annotation is: (and (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) [2021-11-22 20:16:36,119 INFO L854 garLoopResultBuilder]: At program point L10062-7(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,119 INFO L854 garLoopResultBuilder]: At program point L10062-8(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,119 INFO L858 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2021-11-22 20:16:36,119 INFO L854 garLoopResultBuilder]: At program point L10062-13(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,119 INFO L854 garLoopResultBuilder]: At program point L10062-14(lines 10017 10064) the Hoare annotation is: false [2021-11-22 20:16:36,120 INFO L858 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2021-11-22 20:16:36,120 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,120 INFO L854 garLoopResultBuilder]: At program point L10130(lines 10119 10131) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) (.cse4 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse5 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1)) (.cse6 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0)) (.cse7 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)))) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) .cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (exists ((|v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10|) 0))) (and (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) .cse1) (not (= |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) .cse1)))) .cse2 .cse3 .cse4 .cse5 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) .cse6 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res#1| 1) 0)))) [2021-11-22 20:16:36,120 INFO L858 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2021-11-22 20:16:36,120 INFO L858 garLoopResultBuilder]: For program point L9337-2(lines 9337 9343) no Hoare annotation was computed. [2021-11-22 20:16:36,120 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,121 INFO L858 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2021-11-22 20:16:36,121 INFO L854 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: false [2021-11-22 20:16:36,121 INFO L854 garLoopResultBuilder]: At program point L7356(lines 7348 7357) the Hoare annotation is: false [2021-11-22 20:16:36,121 INFO L858 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2021-11-22 20:16:36,121 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,121 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,121 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,121 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,122 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,122 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,122 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,122 INFO L854 garLoopResultBuilder]: At program point L9141(lines 9121 9142) the Hoare annotation is: false [2021-11-22 20:16:36,122 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,122 INFO L854 garLoopResultBuilder]: At program point L9141-1(lines 9121 9142) the Hoare annotation is: false [2021-11-22 20:16:36,122 INFO L858 garLoopResultBuilder]: For program point L10132(lines 10132 10186) no Hoare annotation was computed. [2021-11-22 20:16:36,122 INFO L858 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-8(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-10(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-11(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-12(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-13(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-14(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,123 INFO L858 garLoopResultBuilder]: For program point L222-15(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L222-16(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L222-17(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L222-18(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L222-19(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L222-20(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,124 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L854 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: false [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,125 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,126 INFO L858 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-30(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-31(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-33(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-34(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,127 INFO L858 garLoopResultBuilder]: For program point L223-36(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-37(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-39(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-40(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-42(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-43(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-45(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-46(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-48(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,128 INFO L858 garLoopResultBuilder]: For program point L223-49(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-51(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-52(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-54(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-55(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-57(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-58(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-60(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,129 INFO L858 garLoopResultBuilder]: For program point L223-61(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,130 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 20:16:36,130 INFO L858 garLoopResultBuilder]: For program point L10136(lines 10136 10138) no Hoare annotation was computed. [2021-11-22 20:16:36,130 INFO L858 garLoopResultBuilder]: For program point L10136-2(lines 10136 10138) no Hoare annotation was computed. [2021-11-22 20:16:36,130 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-22 20:16:36,130 INFO L854 garLoopResultBuilder]: At program point L9147(lines 9147 9155) the Hoare annotation is: false [2021-11-22 20:16:36,130 INFO L854 garLoopResultBuilder]: At program point L9147-1(lines 9147 9155) the Hoare annotation is: false [2021-11-22 20:16:36,130 INFO L854 garLoopResultBuilder]: At program point L9345(lines 9321 9346) the Hoare annotation is: false [2021-11-22 20:16:36,130 INFO L858 garLoopResultBuilder]: For program point L10139(lines 10139 10141) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L10139-2(lines 10139 10141) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L854 garLoopResultBuilder]: At program point L10008-6(lines 10006 10009) the Hoare annotation is: false [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,131 INFO L858 garLoopResultBuilder]: For program point L10008-12(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,132 INFO L854 garLoopResultBuilder]: At program point L10008-13(lines 10006 10009) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-11-22 20:16:36,132 INFO L858 garLoopResultBuilder]: For program point L10008-14(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,132 INFO L858 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,132 INFO L858 garLoopResultBuilder]: For program point L10008-9(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,132 INFO L858 garLoopResultBuilder]: For program point L10008-10(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,132 INFO L858 garLoopResultBuilder]: For program point L10008-19(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,132 INFO L854 garLoopResultBuilder]: At program point L10008-20(lines 10006 10009) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-21(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-16(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-17(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,133 INFO L854 garLoopResultBuilder]: At program point L10008-27(lines 10006 10009) the Hoare annotation is: false [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-28(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-30(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-23(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,133 INFO L858 garLoopResultBuilder]: For program point L10008-24(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-26(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-35(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-37(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-38(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-31(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-33(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,134 INFO L854 garLoopResultBuilder]: At program point L10008-34(lines 10006 10009) the Hoare annotation is: false [2021-11-22 20:16:36,134 INFO L858 garLoopResultBuilder]: For program point L10008-40(line 10008) no Hoare annotation was computed. [2021-11-22 20:16:36,135 INFO L854 garLoopResultBuilder]: At program point L10008-41(lines 10006 10009) the Hoare annotation is: false [2021-11-22 20:16:36,135 INFO L858 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2021-11-22 20:16:36,135 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:16:36,135 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24)) (.cse1 (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (.cse2 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|)) (.cse4 (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4)) (.cse6 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|)) (.cse9 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse10 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse11 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse12 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base| 0))) (.cse13 (not (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) (.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (.cse15 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1)) (.cse16 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse17 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset| 0)) (.cse18 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) (.cse19 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (let ((.cse21 (select .cse20 0))) (and .cse0 .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) .cse2 .cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select .cse20 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse13 (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) .cse21) .cse14 (= |ULTIMATE.start_aws_add_u64_checked_~a#1| .cse21) .cse15 .cse16 .cse17 (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) .cse18 .cse19))))) [2021-11-22 20:16:36,138 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:16:36,139 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:16:36,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,162 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,174 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,174 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:16:36 BoogieIcfgContainer [2021-11-22 20:16:36,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:16:36,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:16:36,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:16:36,180 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:16:36,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:15:15" (3/4) ... [2021-11-22 20:16:36,183 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 20:16:36,216 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 397 nodes and edges [2021-11-22 20:16:36,219 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2021-11-22 20:16:36,222 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2021-11-22 20:16:36,225 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-11-22 20:16:36,228 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 20:16:36,231 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 20:16:36,234 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 20:16:36,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 20:16:36,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) [2021-11-22 20:16:36,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && \result + 1 <= 0) || (((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) [2021-11-22 20:16:36,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map) [2021-11-22 20:16:36,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((max_table_entries == 4 && map == map) && required_bytes == 0) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10 : int :: (24 * num_entries == unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10][0] && !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10 == map)) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10][0])) && map == map) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((map == map && map == map) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && map == 0) && !(required_bytes == map)) && \result + 1 <= 0) [2021-11-22 20:16:36,266 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && \result + 1 <= 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && unknown-#StackHeapBarrier-unknown + 1 <= map) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) [2021-11-22 20:16:36,266 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && \result + 1 <= 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && \result + 1 <= 0) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && unknown-#StackHeapBarrier-unknown + 1 <= map) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) [2021-11-22 20:16:36,266 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map) [2021-11-22 20:16:36,267 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((map == map && map == map) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map) && !(map == 0)) && map == map [2021-11-22 20:16:36,268 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((#memory_$Pointer$[map][map] == 0 && map == map) && #memory_$Pointer$[map][map] == 0) && map == map) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map) && !(map == 0)) && map == map [2021-11-22 20:16:36,268 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) [2021-11-22 20:16:36,269 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) [2021-11-22 20:16:36,270 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) [2021-11-22 20:16:36,270 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) [2021-11-22 20:16:36,272 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) [2021-11-22 20:16:36,866 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 20:16:36,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:16:36,867 INFO L158 Benchmark]: Toolchain (without parser) took 85911.80ms. Allocated memory was 102.8MB in the beginning and 977.3MB in the end (delta: 874.5MB). Free memory was 64.1MB in the beginning and 558.4MB in the end (delta: -494.3MB). Peak memory consumption was 642.2MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,867 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:16:36,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2580.66ms. Allocated memory was 102.8MB in the beginning and 159.4MB in the end (delta: 56.6MB). Free memory was 64.1MB in the beginning and 72.3MB in the end (delta: -8.1MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 268.49ms. Allocated memory is still 159.4MB. Free memory was 72.3MB in the beginning and 92.9MB in the end (delta: -20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,868 INFO L158 Benchmark]: Boogie Preprocessor took 156.84ms. Allocated memory is still 159.4MB. Free memory was 92.9MB in the beginning and 79.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,868 INFO L158 Benchmark]: RCFGBuilder took 1815.80ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 78.2MB in the beginning and 154.4MB in the end (delta: -76.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,868 INFO L158 Benchmark]: TraceAbstraction took 80395.85ms. Allocated memory was 247.5MB in the beginning and 977.3MB in the end (delta: 729.8MB). Free memory was 154.4MB in the beginning and 781.1MB in the end (delta: -626.8MB). Peak memory consumption was 567.6MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,869 INFO L158 Benchmark]: Witness Printer took 686.20ms. Allocated memory is still 977.3MB. Free memory was 781.1MB in the beginning and 558.4MB in the end (delta: 222.7MB). Peak memory consumption was 484.9MB. Max. memory is 16.1GB. [2021-11-22 20:16:36,870 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.22ms. Allocated memory is still 102.8MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2580.66ms. Allocated memory was 102.8MB in the beginning and 159.4MB in the end (delta: 56.6MB). Free memory was 64.1MB in the beginning and 72.3MB in the end (delta: -8.1MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 268.49ms. Allocated memory is still 159.4MB. Free memory was 72.3MB in the beginning and 92.9MB in the end (delta: -20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.84ms. Allocated memory is still 159.4MB. Free memory was 92.9MB in the beginning and 79.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1815.80ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 78.2MB in the beginning and 154.4MB in the end (delta: -76.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * TraceAbstraction took 80395.85ms. Allocated memory was 247.5MB in the beginning and 977.3MB in the end (delta: 729.8MB). Free memory was 154.4MB in the beginning and 781.1MB in the end (delta: -626.8MB). Peak memory consumption was 567.6MB. Max. memory is 16.1GB. * Witness Printer took 686.20ms. Allocated memory is still 977.3MB. Free memory was 781.1MB in the beginning and 558.4MB in the end (delta: 222.7MB). Peak memory consumption was 484.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 369 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 80.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19149 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19149 mSDsluCounter, 42506 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 24 IncrementalHoareTripleChecker+Unchecked, 31306 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6119 IncrementalHoareTripleChecker+Invalid, 6673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 11200 mSDtfsCounter, 6119 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=15, InterpolantAutomatonStates: 242, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 3735 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 102 LocationsWithAnnotation, 102 PreInvPairs, 126 NumberOfFragments, 1561 HoareAnnotationTreeSize, 102 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 102 FomulaSimplificationsInter, 802 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 50.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2135 ConstructedInterpolants, 4 QuantifiedInterpolants, 11211 SizeOfPredicates, 60 NumberOfNonLiveVariables, 9167 ConjunctsInSsa, 493 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && \result + 1 <= 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && \result + 1 <= 0) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && unknown-#StackHeapBarrier-unknown + 1 <= map) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) - InvariantResult [Line: 10187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((max_table_entries == 4 && map == map) && map == map) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && map == 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map) - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map) - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9709]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9621]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9100]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9692]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10119]: Loop Invariant [2021-11-22 20:16:36,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] [2021-11-22 20:16:36,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10,QUANTIFIED] Derived loop invariant: (((((((((((max_table_entries == 4 && map == map) && required_bytes == 0) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10 : int :: (24 * num_entries == unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10][0] && !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10 == map)) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_10][0])) && map == map) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((map == map && map == map) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && map == 0) && !(required_bytes == map)) && \result + 1 <= 0) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7399]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-11-22 20:16:36,905 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,905 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((map == map && map == map) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map) && !(map == 0)) && map == map - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9121]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9635]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && \result + 1 <= 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && unknown-#StackHeapBarrier-unknown + 1 <= map) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) || (((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9160]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) - InvariantResult [Line: 9321]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9661]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map) - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((cond == 1 && max_table_entries == 4) && map == map) && map == map) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9121]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-11-22 20:16:36,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:16:36,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:16:36,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((#memory_$Pointer$[map][map] == 0 && map == map) && #memory_$Pointer$[map][map] == 0) && map == map) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map) && !(map == 0)) && map == map - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) - InvariantResult [Line: 9157]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && \result + 1 <= 0) || (((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && map == map) && !(map == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && !(elemsize == map)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[map] == 1) && \valid[required_bytes] == 1) && map == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((\result == 0 && map == map) && !(\result == 0)) && map == map) && !(map == 0) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-22 20:16:36,973 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