./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:31:46,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:31:46,572 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 20:31:46,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:31:46,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:31:46,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:31:46,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:31:46,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:31:46,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:31:46,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:31:46,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:31:46,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:31:46,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:31:46,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:31:46,604 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:31:46,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:31:46,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:31:46,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:31:46,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:31:46,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:31:46,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:31:46,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:31:46,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:46,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:46,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:46,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:31:46,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:31:46,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:31:46,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:31:46,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:31:46,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:31:46,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:31:46,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:31:46,609 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd [2024-11-27 20:31:46,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:31:46,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:31:46,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:31:46,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:31:46,961 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:31:46,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2024-11-27 20:31:49,996 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/data/f875c25d7/e430a579bd5648a6a2c6429a277c7708/FLAG79f0c3ca2 [2024-11-27 20:31:50,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:31:50,823 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2024-11-27 20:31:50,887 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/data/f875c25d7/e430a579bd5648a6a2c6429a277c7708/FLAG79f0c3ca2 [2024-11-27 20:31:50,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/data/f875c25d7/e430a579bd5648a6a2c6429a277c7708 [2024-11-27 20:31:50,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:31:50,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:31:50,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:50,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:31:50,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:31:50,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:50" (1/1) ... [2024-11-27 20:31:50,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dffe8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:50, skipping insertion in model container [2024-11-27 20:31:50,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:50" (1/1) ... [2024-11-27 20:31:51,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:31:51,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2024-11-27 20:31:51,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2024-11-27 20:31:52,653 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,654 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,655 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,656 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,657 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,674 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,675 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,677 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,678 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,681 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,682 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,683 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:52,683 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,945 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,946 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,971 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,972 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,978 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,978 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,993 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,994 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,994 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,995 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,995 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,995 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:53,996 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[227916,227929] [2024-11-27 20:31:54,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:54,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:31:54,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2024-11-27 20:31:54,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2024-11-27 20:31:54,225 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,225 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,226 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,226 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,227 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,234 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,234 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,235 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,236 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,239 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,239 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,240 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,240 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2024-11-27 20:31:54,430 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,431 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,468 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,470 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,473 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,473 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,486 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,488 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,489 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,490 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,491 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,491 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,491 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 20:31:54,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[227916,227929] [2024-11-27 20:31:54,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:54,839 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:31:54,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54 WrapperNode [2024-11-27 20:31:54,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:54,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:54,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:31:54,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:31:54,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:54,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,058 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2024-11-27 20:31:55,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:55,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:31:55,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:31:55,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:31:55,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,102 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-27 20:31:55,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:31:55,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:31:55,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:31:55,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:31:55,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (1/1) ... [2024-11-27 20:31:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:55,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:31:55,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:31:55,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:31:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2024-11-27 20:31:55,279 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2024-11-27 20:31:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-27 20:31:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:31:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-27 20:31:55,279 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-27 20:31:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-11-27 20:31:55,279 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-11-27 20:31:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-27 20:31:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2024-11-27 20:31:55,281 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2024-11-27 20:31:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-27 20:31:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-11-27 20:31:55,281 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-11-27 20:31:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:31:55,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:31:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-27 20:31:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2024-11-27 20:31:55,282 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2024-11-27 20:31:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:31:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:31:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2024-11-27 20:31:55,283 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2024-11-27 20:31:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-27 20:31:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:31:55,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:31:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-11-27 20:31:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-11-27 20:31:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 20:31:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2024-11-27 20:31:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2024-11-27 20:31:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2024-11-27 20:31:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-27 20:31:55,285 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-11-27 20:31:55,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2024-11-27 20:31:55,285 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2024-11-27 20:31:55,285 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 20:31:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2024-11-27 20:31:55,288 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2024-11-27 20:31:55,741 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:31:55,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:31:56,628 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:32:02,170 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2024-11-27 20:32:02,171 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2024-11-27 20:32:02,295 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-27 20:32:02,295 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:32:02,306 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:32:02,307 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:32:02,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:32:02 BoogieIcfgContainer [2024-11-27 20:32:02,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:32:02,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:32:02,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:32:02,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:32:02,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:31:50" (1/3) ... [2024-11-27 20:32:02,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380371aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:32:02, skipping insertion in model container [2024-11-27 20:32:02,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:54" (2/3) ... [2024-11-27 20:32:02,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380371aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:32:02, skipping insertion in model container [2024-11-27 20:32:02,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:32:02" (3/3) ... [2024-11-27 20:32:02,316 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2024-11-27 20:32:02,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:32:02,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness.i that has 19 procedures, 191 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:32:02,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:32:02,415 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b9b35ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:32:02,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:32:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 137 states have internal predecessors, (175), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-27 20:32:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 20:32:02,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:02,433 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:02,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:02,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1734843285, now seen corresponding path program 1 times [2024-11-27 20:32:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640204565] [2024-11-27 20:32:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-27 20:32:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640204565] [2024-11-27 20:32:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640204565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:32:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282940324] [2024-11-27 20:32:10,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:10,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:32:10,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:32:10,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:32:10,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:32:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:17,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:32:17,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:32:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-27 20:32:17,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:32:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282940324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:17,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:32:17,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 20:32:17,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147723886] [2024-11-27 20:32:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:32:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:17,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:32:17,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:32:17,982 INFO L87 Difference]: Start difference. First operand has 191 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 137 states have internal predecessors, (175), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-27 20:32:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:18,056 INFO L93 Difference]: Finished difference Result 371 states and 495 transitions. [2024-11-27 20:32:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:32:18,058 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2024-11-27 20:32:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:18,072 INFO L225 Difference]: With dead ends: 371 [2024-11-27 20:32:18,073 INFO L226 Difference]: Without dead ends: 184 [2024-11-27 20:32:18,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:32:18,083 INFO L435 NwaCegarLoop]: 240 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, 240 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 [2024-11-27 20:32:18,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:32:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-27 20:32:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-27 20:32:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 131 states have internal predecessors, (164), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-27 20:32:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2024-11-27 20:32:18,167 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 70 [2024-11-27 20:32:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:18,169 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2024-11-27 20:32:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-27 20:32:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2024-11-27 20:32:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 20:32:18,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:18,172 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:18,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:32:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-27 20:32:18,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1662150887, now seen corresponding path program 1 times [2024-11-27 20:32:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434474780] [2024-11-27 20:32:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:32:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434474780] [2024-11-27 20:32:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434474780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:25,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:32:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624329583] [2024-11-27 20:32:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:25,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:32:25,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:25,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:32:25,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:32:25,316 INFO L87 Difference]: Start difference. First operand 184 states and 233 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-27 20:32:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:25,462 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2024-11-27 20:32:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:32:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2024-11-27 20:32:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:25,465 INFO L225 Difference]: With dead ends: 316 [2024-11-27 20:32:25,466 INFO L226 Difference]: Without dead ends: 186 [2024-11-27 20:32:25,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:32:25,467 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:32:25,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:32:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-27 20:32:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-27 20:32:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 133 states have internal predecessors, (166), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-27 20:32:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 235 transitions. [2024-11-27 20:32:25,484 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 235 transitions. Word has length 70 [2024-11-27 20:32:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:25,484 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 235 transitions. [2024-11-27 20:32:25,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-27 20:32:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 235 transitions. [2024-11-27 20:32:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-27 20:32:25,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:25,487 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:25,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:32:25,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:25,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash -475052884, now seen corresponding path program 1 times [2024-11-27 20:32:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:25,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143665188] [2024-11-27 20:32:25,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:32:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143665188] [2024-11-27 20:32:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143665188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:32:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456142229] [2024-11-27 20:32:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:32:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:32,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:32:32,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:32:32,089 INFO L87 Difference]: Start difference. First operand 186 states and 235 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-27 20:32:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:32,226 INFO L93 Difference]: Finished difference Result 224 states and 278 transitions. [2024-11-27 20:32:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:32:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2024-11-27 20:32:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:32,229 INFO L225 Difference]: With dead ends: 224 [2024-11-27 20:32:32,229 INFO L226 Difference]: Without dead ends: 190 [2024-11-27 20:32:32,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:32:32,231 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 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.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:32:32,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:32:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-27 20:32:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-27 20:32:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 136 states have internal predecessors, (169), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-27 20:32:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 239 transitions. [2024-11-27 20:32:32,255 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 239 transitions. Word has length 72 [2024-11-27 20:32:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:32,257 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 239 transitions. [2024-11-27 20:32:32,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-27 20:32:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 239 transitions. [2024-11-27 20:32:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-27 20:32:32,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:32,260 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:32,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:32:32,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:32,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1439224058, now seen corresponding path program 1 times [2024-11-27 20:32:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:32,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642253849] [2024-11-27 20:32:32,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:32:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:38,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642253849] [2024-11-27 20:32:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642253849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:32:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146514393] [2024-11-27 20:32:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:32:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:38,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:32:38,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:32:38,611 INFO L87 Difference]: Start difference. First operand 190 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-27 20:32:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:38,708 INFO L93 Difference]: Finished difference Result 224 states and 277 transitions. [2024-11-27 20:32:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:32:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2024-11-27 20:32:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:38,712 INFO L225 Difference]: With dead ends: 224 [2024-11-27 20:32:38,712 INFO L226 Difference]: Without dead ends: 190 [2024-11-27 20:32:38,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:32:38,713 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:32:38,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:32:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-27 20:32:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2024-11-27 20:32:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 133 states have internal predecessors, (164), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-27 20:32:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2024-11-27 20:32:38,741 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 77 [2024-11-27 20:32:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:38,741 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2024-11-27 20:32:38,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-27 20:32:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2024-11-27 20:32:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 20:32:38,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:38,746 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:32:38,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:38,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1011536445, now seen corresponding path program 1 times [2024-11-27 20:32:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905399856] [2024-11-27 20:32:38,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:32:44,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:44,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905399856] [2024-11-27 20:32:44,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905399856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:44,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:44,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:32:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653683180] [2024-11-27 20:32:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:44,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:32:44,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:44,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:32:44,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:32:44,876 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-27 20:32:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:45,065 INFO L93 Difference]: Finished difference Result 296 states and 363 transitions. [2024-11-27 20:32:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:32:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-27 20:32:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:45,072 INFO L225 Difference]: With dead ends: 296 [2024-11-27 20:32:45,072 INFO L226 Difference]: Without dead ends: 191 [2024-11-27 20:32:45,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:32:45,074 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:32:45,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 908 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:32:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-27 20:32:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-27 20:32:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 137 states have internal predecessors, (168), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-27 20:32:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 240 transitions. [2024-11-27 20:32:45,095 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 240 transitions. Word has length 94 [2024-11-27 20:32:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:45,095 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 240 transitions. [2024-11-27 20:32:45,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-27 20:32:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 240 transitions. [2024-11-27 20:32:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 20:32:45,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:45,098 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:45,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:32:45,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:32:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1521911148, now seen corresponding path program 1 times [2024-11-27 20:32:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45801300] [2024-11-27 20:32:45,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:32:54,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45801300] [2024-11-27 20:32:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45801300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:32:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585651049] [2024-11-27 20:32:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:54,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:32:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:54,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:32:54,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:32:54,072 INFO L87 Difference]: Start difference. First operand 191 states and 240 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-27 20:32:58,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:02,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:06,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:11,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:15,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:18,841 INFO L93 Difference]: Finished difference Result 235 states and 292 transitions. [2024-11-27 20:33:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:33:18,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-27 20:33:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:33:18,850 INFO L225 Difference]: With dead ends: 235 [2024-11-27 20:33:18,850 INFO L226 Difference]: Without dead ends: 199 [2024-11-27 20:33:18,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:33:18,851 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 11 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:33:18,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1264 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 5 Unknown, 0 Unchecked, 24.2s Time] [2024-11-27 20:33:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-27 20:33:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-27 20:33:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 142 states have internal predecessors, (173), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2024-11-27 20:33:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2024-11-27 20:33:18,873 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 100 [2024-11-27 20:33:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:33:18,873 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2024-11-27 20:33:18,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-27 20:33:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2024-11-27 20:33:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 20:33:18,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:33:18,878 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:33:18,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:33:18,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:33:18,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1128884138, now seen corresponding path program 1 times [2024-11-27 20:33:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:33:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852658731] [2024-11-27 20:33:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:33:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:33:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852658731] [2024-11-27 20:33:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852658731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:33:25,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:33:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:33:25,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139925337] [2024-11-27 20:33:25,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:33:25,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:33:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:33:25,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:33:25,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:33:25,767 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-27 20:33:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:26,055 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2024-11-27 20:33:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:33:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-27 20:33:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:33:26,058 INFO L225 Difference]: With dead ends: 242 [2024-11-27 20:33:26,058 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:33:26,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:33:26,060 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 5 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 677 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.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:33:26,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 677 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:33:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:33:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-11-27 20:33:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 143 states have internal predecessors, (174), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-27 20:33:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2024-11-27 20:33:26,086 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 100 [2024-11-27 20:33:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:33:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2024-11-27 20:33:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-27 20:33:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2024-11-27 20:33:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 20:33:26,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:33:26,092 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:33:26,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:33:26,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:33:26,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1119241339, now seen corresponding path program 1 times [2024-11-27 20:33:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:33:26,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879565599] [2024-11-27 20:33:26,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-27 20:33:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:33:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879565599] [2024-11-27 20:33:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879565599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:33:36,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:33:36,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:33:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253900695] [2024-11-27 20:33:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:33:36,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:33:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:33:36,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:33:36,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:33:36,851 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-27 20:33:40,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:45,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:49,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:53,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:33:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:58,891 INFO L93 Difference]: Finished difference Result 249 states and 308 transitions. [2024-11-27 20:33:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:33:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 106 [2024-11-27 20:33:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:33:58,894 INFO L225 Difference]: With dead ends: 249 [2024-11-27 20:33:58,894 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:33:58,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:33:58,896 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 7 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:33:58,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1714 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 21.6s Time] [2024-11-27 20:33:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:33:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-11-27 20:33:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 143 states have internal predecessors, (172), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-27 20:33:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2024-11-27 20:33:58,911 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 106 [2024-11-27 20:33:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:33:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2024-11-27 20:33:58,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-27 20:33:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2024-11-27 20:33:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-27 20:33:58,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:33:58,915 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:33:58,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:33:58,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:33:58,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1357800383, now seen corresponding path program 1 times [2024-11-27 20:33:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:33:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330611759] [2024-11-27 20:33:58,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-27 20:34:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330611759] [2024-11-27 20:34:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330611759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:34:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433180991] [2024-11-27 20:34:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:34:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:05,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:34:05,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:34:05,073 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 20:34:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:05,158 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2024-11-27 20:34:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:34:05,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2024-11-27 20:34:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:34:05,161 INFO L225 Difference]: With dead ends: 313 [2024-11-27 20:34:05,162 INFO L226 Difference]: Without dead ends: 198 [2024-11-27 20:34:05,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:34:05,163 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:34:05,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 686 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:34:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-27 20:34:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2024-11-27 20:34:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 137 states have (on average 1.2116788321167884) internal successors, (166), 139 states have internal predecessors, (166), 36 states have call successors, (36), 18 states have call predecessors, (36), 19 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2024-11-27 20:34:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2024-11-27 20:34:05,175 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 141 [2024-11-27 20:34:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:34:05,176 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2024-11-27 20:34:05,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 20:34:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2024-11-27 20:34:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-27 20:34:05,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:34:05,179 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:05,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:34:05,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:34:05,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash -200941205, now seen corresponding path program 1 times [2024-11-27 20:34:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160293929] [2024-11-27 20:34:05,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-27 20:34:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160293929] [2024-11-27 20:34:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160293929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:11,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:11,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:34:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254398217] [2024-11-27 20:34:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:34:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:11,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:34:11,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:34:11,142 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-27 20:34:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:11,400 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2024-11-27 20:34:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:34:11,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2024-11-27 20:34:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:34:11,403 INFO L225 Difference]: With dead ends: 248 [2024-11-27 20:34:11,404 INFO L226 Difference]: Without dead ends: 198 [2024-11-27 20:34:11,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:34:11,405 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:34:11,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 890 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:34:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-27 20:34:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-27 20:34:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2056737588652482) internal successors, (170), 143 states have internal predecessors, (170), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-27 20:34:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 245 transitions. [2024-11-27 20:34:11,473 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 245 transitions. Word has length 147 [2024-11-27 20:34:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:34:11,474 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 245 transitions. [2024-11-27 20:34:11,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-27 20:34:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2024-11-27 20:34:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-27 20:34:11,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:34:11,479 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:11,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:34:11,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:34:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1764365140, now seen corresponding path program 1 times [2024-11-27 20:34:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415756533] [2024-11-27 20:34:11,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-27 20:34:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415756533] [2024-11-27 20:34:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415756533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:34:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987685720] [2024-11-27 20:34:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:34:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:18,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:34:18,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:34:18,879 INFO L87 Difference]: Start difference. First operand 198 states and 245 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-27 20:34:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:19,137 INFO L93 Difference]: Finished difference Result 248 states and 303 transitions. [2024-11-27 20:34:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:34:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2024-11-27 20:34:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:34:19,141 INFO L225 Difference]: With dead ends: 248 [2024-11-27 20:34:19,141 INFO L226 Difference]: Without dead ends: 198 [2024-11-27 20:34:19,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:34:19,142 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:34:19,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:34:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-27 20:34:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2024-11-27 20:34:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 137 states have (on average 1.2043795620437956) internal successors, (165), 139 states have internal predecessors, (165), 36 states have call successors, (36), 18 states have call predecessors, (36), 19 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2024-11-27 20:34:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2024-11-27 20:34:19,162 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 153 [2024-11-27 20:34:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:34:19,163 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2024-11-27 20:34:19,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-27 20:34:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2024-11-27 20:34:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-27 20:34:19,168 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:34:19,168 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:19,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:34:19,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:34:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash 965134937, now seen corresponding path program 1 times [2024-11-27 20:34:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231940667] [2024-11-27 20:34:19,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-27 20:34:26,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:26,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231940667] [2024-11-27 20:34:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231940667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:26,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:34:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512201157] [2024-11-27 20:34:26,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:26,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:34:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:26,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:34:26,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:34:26,445 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-27 20:34:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:26,810 INFO L93 Difference]: Finished difference Result 250 states and 303 transitions. [2024-11-27 20:34:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:34:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-11-27 20:34:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:34:26,813 INFO L225 Difference]: With dead ends: 250 [2024-11-27 20:34:26,813 INFO L226 Difference]: Without dead ends: 199 [2024-11-27 20:34:26,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:34:26,815 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 2 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:34:26,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1101 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:34:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-27 20:34:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-11-27 20:34:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.198581560283688) internal successors, (169), 143 states have internal predecessors, (169), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (37), 36 states have call predecessors, (37), 35 states have call successors, (37) [2024-11-27 20:34:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 242 transitions. [2024-11-27 20:34:26,832 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 242 transitions. Word has length 160 [2024-11-27 20:34:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:34:26,836 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 242 transitions. [2024-11-27 20:34:26,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-27 20:34:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 242 transitions. [2024-11-27 20:34:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-27 20:34:26,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:34:26,839 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:26,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:34:26,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:34:26,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2097784857, now seen corresponding path program 1 times [2024-11-27 20:34:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713597259] [2024-11-27 20:34:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-27 20:34:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:34,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713597259] [2024-11-27 20:34:34,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713597259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:34,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:34,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:34:34,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879102815] [2024-11-27 20:34:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:34,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:34:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:34,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:34:34,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:34:34,937 INFO L87 Difference]: Start difference. First operand 198 states and 242 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-27 20:34:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:36,243 INFO L93 Difference]: Finished difference Result 249 states and 301 transitions. [2024-11-27 20:34:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:34:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2024-11-27 20:34:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:34:36,252 INFO L225 Difference]: With dead ends: 249 [2024-11-27 20:34:36,252 INFO L226 Difference]: Without dead ends: 191 [2024-11-27 20:34:36,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:34:36,253 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:34:36,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1538 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:34:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-27 20:34:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-27 20:34:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.1911764705882353) internal successors, (162), 138 states have internal predecessors, (162), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-27 20:34:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-11-27 20:34:36,277 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 166 [2024-11-27 20:34:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:34:36,278 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-11-27 20:34:36,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-27 20:34:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-11-27 20:34:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-27 20:34:36,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:34:36,280 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:36,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:34:36,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:34:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1128868307, now seen corresponding path program 1 times [2024-11-27 20:34:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548362237] [2024-11-27 20:34:36,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:34:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548362237] [2024-11-27 20:34:44,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548362237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:44,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:44,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:34:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040188256] [2024-11-27 20:34:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:44,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:34:44,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:44,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:34:44,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:34:44,097 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-27 20:34:48,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:34:52,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:34:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:54,532 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2024-11-27 20:34:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:34:54,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 185 [2024-11-27 20:34:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:34:54,535 INFO L225 Difference]: With dead ends: 237 [2024-11-27 20:34:54,535 INFO L226 Difference]: Without dead ends: 192 [2024-11-27 20:34:54,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:34:54,537 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:34:54,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1249 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-11-27 20:34:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-27 20:34:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2024-11-27 20:34:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.1838235294117647) internal successors, (161), 138 states have internal predecessors, (161), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-27 20:34:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2024-11-27 20:34:54,550 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 185 [2024-11-27 20:34:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:34:54,551 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2024-11-27 20:34:54,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-27 20:34:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2024-11-27 20:34:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-27 20:34:54,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:34:54,554 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:54,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:34:54,554 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:34:54,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -821047252, now seen corresponding path program 1 times [2024-11-27 20:34:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:54,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101678530] [2024-11-27 20:34:54,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:35:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101678530] [2024-11-27 20:35:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101678530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:01,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:35:01,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621193364] [2024-11-27 20:35:01,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:01,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:35:01,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:01,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:35:01,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:35:01,399 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:35:02,116 INFO L93 Difference]: Finished difference Result 337 states and 397 transitions. [2024-11-27 20:35:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:35:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192 [2024-11-27 20:35:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:35:02,119 INFO L225 Difference]: With dead ends: 337 [2024-11-27 20:35:02,119 INFO L226 Difference]: Without dead ends: 194 [2024-11-27 20:35:02,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:35:02,121 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:35:02,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 610 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:35:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-27 20:35:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-27 20:35:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 141 states have internal predecessors, (164), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-27 20:35:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2024-11-27 20:35:02,134 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 192 [2024-11-27 20:35:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:35:02,134 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2024-11-27 20:35:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2024-11-27 20:35:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-27 20:35:02,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:35:02,137 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:02,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:35:02,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:35:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1075932206, now seen corresponding path program 1 times [2024-11-27 20:35:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522939164] [2024-11-27 20:35:02,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:35:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522939164] [2024-11-27 20:35:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522939164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:11,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:35:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742621280] [2024-11-27 20:35:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:35:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:11,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:35:11,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:35:11,193 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:35:12,289 INFO L93 Difference]: Finished difference Result 333 states and 389 transitions. [2024-11-27 20:35:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:35:12,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192 [2024-11-27 20:35:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:35:12,292 INFO L225 Difference]: With dead ends: 333 [2024-11-27 20:35:12,292 INFO L226 Difference]: Without dead ends: 194 [2024-11-27 20:35:12,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:35:12,293 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:35:12,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 594 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 20:35:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-27 20:35:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-27 20:35:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 141 states have internal predecessors, (163), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-27 20:35:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2024-11-27 20:35:12,306 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 192 [2024-11-27 20:35:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:35:12,307 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2024-11-27 20:35:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2024-11-27 20:35:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-27 20:35:12,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:35:12,309 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:12,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:35:12,309 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:35:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash 109488580, now seen corresponding path program 1 times [2024-11-27 20:35:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34818515] [2024-11-27 20:35:12,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:35:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34818515] [2024-11-27 20:35:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34818515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:35:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888051448] [2024-11-27 20:35:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:35:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:18,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:35:18,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:35:18,420 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-27 20:35:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:35:18,534 INFO L93 Difference]: Finished difference Result 329 states and 383 transitions. [2024-11-27 20:35:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:35:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 197 [2024-11-27 20:35:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:35:18,537 INFO L225 Difference]: With dead ends: 329 [2024-11-27 20:35:18,537 INFO L226 Difference]: Without dead ends: 194 [2024-11-27 20:35:18,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:35:18,538 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:35:18,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:35:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-27 20:35:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-27 20:35:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.167883211678832) internal successors, (160), 139 states have internal predecessors, (160), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-27 20:35:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2024-11-27 20:35:18,550 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 197 [2024-11-27 20:35:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:35:18,551 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2024-11-27 20:35:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-27 20:35:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2024-11-27 20:35:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-27 20:35:18,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:35:18,553 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:18,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:35:18,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:35:18,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash 495167305, now seen corresponding path program 1 times [2024-11-27 20:35:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754986486] [2024-11-27 20:35:18,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:35:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754986486] [2024-11-27 20:35:25,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754986486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:25,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:25,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:35:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702019322] [2024-11-27 20:35:25,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:25,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:35:25,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:25,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:35:25,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:35:25,359 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-27 20:35:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:35:25,543 INFO L93 Difference]: Finished difference Result 331 states and 385 transitions. [2024-11-27 20:35:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:35:25,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 199 [2024-11-27 20:35:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:35:25,546 INFO L225 Difference]: With dead ends: 331 [2024-11-27 20:35:25,546 INFO L226 Difference]: Without dead ends: 190 [2024-11-27 20:35:25,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:35:25,551 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:35:25,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1073 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:35:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-27 20:35:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-27 20:35:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 135 states have internal predecessors, (155), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:35:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2024-11-27 20:35:25,565 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 199 [2024-11-27 20:35:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:35:25,566 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2024-11-27 20:35:25,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-27 20:35:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2024-11-27 20:35:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-27 20:35:25,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:35:25,568 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:25,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:35:25,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:35:25,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash -9410609, now seen corresponding path program 1 times [2024-11-27 20:35:25,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:25,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094753783] [2024-11-27 20:35:25,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:35:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094753783] [2024-11-27 20:35:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094753783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:35:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114727377] [2024-11-27 20:35:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:35:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:37,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:35:37,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:35:37,091 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:35:38,363 INFO L93 Difference]: Finished difference Result 353 states and 417 transitions. [2024-11-27 20:35:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:35:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 205 [2024-11-27 20:35:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:35:38,366 INFO L225 Difference]: With dead ends: 353 [2024-11-27 20:35:38,366 INFO L226 Difference]: Without dead ends: 193 [2024-11-27 20:35:38,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:35:38,367 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:35:38,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 761 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:35:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-27 20:35:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-27 20:35:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 137 states have (on average 1.1605839416058394) internal successors, (159), 139 states have internal predecessors, (159), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:35:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2024-11-27 20:35:38,379 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 205 [2024-11-27 20:35:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:35:38,379 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2024-11-27 20:35:38,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2024-11-27 20:35:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-27 20:35:38,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:35:38,381 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:38,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:35:38,381 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:35:38,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2090327821, now seen corresponding path program 1 times [2024-11-27 20:35:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:38,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875036097] [2024-11-27 20:35:38,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:35:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875036097] [2024-11-27 20:35:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875036097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:49,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:49,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:35:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761836578] [2024-11-27 20:35:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:49,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:35:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:49,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:35:49,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:35:49,478 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:35:50,955 INFO L93 Difference]: Finished difference Result 351 states and 413 transitions. [2024-11-27 20:35:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:35:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 205 [2024-11-27 20:35:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:35:50,958 INFO L225 Difference]: With dead ends: 351 [2024-11-27 20:35:50,958 INFO L226 Difference]: Without dead ends: 191 [2024-11-27 20:35:50,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:35:50,960 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:35:50,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 729 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 20:35:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-27 20:35:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-11-27 20:35:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 135 states have internal predecessors, (154), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:35:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2024-11-27 20:35:50,971 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 205 [2024-11-27 20:35:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:35:50,972 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2024-11-27 20:35:50,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:35:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2024-11-27 20:35:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-27 20:35:50,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:35:50,974 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:50,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:35:50,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:35:50,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash -380151606, now seen corresponding path program 1 times [2024-11-27 20:35:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:50,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836629833] [2024-11-27 20:35:50,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:36:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:36:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:36:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:36:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836629833] [2024-11-27 20:36:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836629833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:36:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:36:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:36:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953591862] [2024-11-27 20:36:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:36:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:36:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:36:02,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:36:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:36:02,966 INFO L87 Difference]: Start difference. First operand 187 states and 222 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:36:03,900 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2024-11-27 20:36:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:36:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 206 [2024-11-27 20:36:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:36:03,903 INFO L225 Difference]: With dead ends: 356 [2024-11-27 20:36:03,903 INFO L226 Difference]: Without dead ends: 195 [2024-11-27 20:36:03,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:36:03,904 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:36:03,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 785 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 20:36:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-27 20:36:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-27 20:36:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 141 states have (on average 1.148936170212766) internal successors, (162), 143 states have internal predecessors, (162), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:36:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2024-11-27 20:36:03,914 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 206 [2024-11-27 20:36:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:36:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2024-11-27 20:36:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2024-11-27 20:36:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-27 20:36:03,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:36:03,917 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:36:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 20:36:03,917 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:36:03,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:36:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 287230284, now seen corresponding path program 1 times [2024-11-27 20:36:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:36:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779164356] [2024-11-27 20:36:03,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:36:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:36:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:36:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:36:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:36:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779164356] [2024-11-27 20:36:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779164356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:36:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:36:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:36:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016573153] [2024-11-27 20:36:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:36:15,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:36:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:36:15,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:36:15,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:36:15,584 INFO L87 Difference]: Start difference. First operand 195 states and 230 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:36:16,429 INFO L93 Difference]: Finished difference Result 351 states and 410 transitions. [2024-11-27 20:36:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:36:16,431 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), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 206 [2024-11-27 20:36:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:36:16,434 INFO L225 Difference]: With dead ends: 351 [2024-11-27 20:36:16,434 INFO L226 Difference]: Without dead ends: 195 [2024-11-27 20:36:16,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:36:16,437 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 7 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:36:16,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:36:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-27 20:36:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-27 20:36:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 143 states have internal predecessors, (161), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:36:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 229 transitions. [2024-11-27 20:36:16,449 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 229 transitions. Word has length 206 [2024-11-27 20:36:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:36:16,449 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 229 transitions. [2024-11-27 20:36:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 229 transitions. [2024-11-27 20:36:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-27 20:36:16,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:36:16,452 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:36:16,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 20:36:16,453 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:36:16,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:36:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1819033432, now seen corresponding path program 1 times [2024-11-27 20:36:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:36:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560697180] [2024-11-27 20:36:16,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:36:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:36:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:36:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:36:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:36:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560697180] [2024-11-27 20:36:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560697180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:36:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:36:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:36:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753972138] [2024-11-27 20:36:27,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:36:27,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:36:27,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:36:27,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:36:27,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:36:27,239 INFO L87 Difference]: Start difference. First operand 195 states and 229 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:36:28,437 INFO L93 Difference]: Finished difference Result 351 states and 409 transitions. [2024-11-27 20:36:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:36:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 207 [2024-11-27 20:36:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:36:28,440 INFO L225 Difference]: With dead ends: 351 [2024-11-27 20:36:28,440 INFO L226 Difference]: Without dead ends: 198 [2024-11-27 20:36:28,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:36:28,442 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:36:28,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 972 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 20:36:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-27 20:36:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-27 20:36:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 146 states have internal predecessors, (164), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:36:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 232 transitions. [2024-11-27 20:36:28,451 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 232 transitions. Word has length 207 [2024-11-27 20:36:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:36:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 232 transitions. [2024-11-27 20:36:28,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 232 transitions. [2024-11-27 20:36:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-27 20:36:28,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:36:28,453 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:36:28,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 20:36:28,453 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:36:28,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:36:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1689935974, now seen corresponding path program 1 times [2024-11-27 20:36:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:36:28,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393187328] [2024-11-27 20:36:28,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:36:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:36:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:36:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:36:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:36:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393187328] [2024-11-27 20:36:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393187328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:36:38,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:36:38,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:36:38,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019734694] [2024-11-27 20:36:38,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:36:38,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:36:38,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:36:38,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:36:38,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:36:38,857 INFO L87 Difference]: Start difference. First operand 198 states and 232 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:36:40,026 INFO L93 Difference]: Finished difference Result 350 states and 406 transitions. [2024-11-27 20:36:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:36:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 207 [2024-11-27 20:36:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:36:40,029 INFO L225 Difference]: With dead ends: 350 [2024-11-27 20:36:40,030 INFO L226 Difference]: Without dead ends: 198 [2024-11-27 20:36:40,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:36:40,031 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 7 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:36:40,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 735 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 20:36:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-27 20:36:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-27 20:36:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.1319444444444444) internal successors, (163), 146 states have internal predecessors, (163), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:36:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2024-11-27 20:36:40,042 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 207 [2024-11-27 20:36:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:36:40,043 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2024-11-27 20:36:40,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2024-11-27 20:36:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-27 20:36:40,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:36:40,045 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:36:40,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 20:36:40,046 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:36:40,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:36:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1827379267, now seen corresponding path program 1 times [2024-11-27 20:36:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:36:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829853481] [2024-11-27 20:36:40,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:36:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:36:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:36:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:36:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:36:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829853481] [2024-11-27 20:36:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829853481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:36:53,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:36:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:36:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114812699] [2024-11-27 20:36:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:36:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:36:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:36:53,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:36:53,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:36:53,236 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:36:54,796 INFO L93 Difference]: Finished difference Result 350 states and 405 transitions. [2024-11-27 20:36:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:36:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 208 [2024-11-27 20:36:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:36:54,800 INFO L225 Difference]: With dead ends: 350 [2024-11-27 20:36:54,800 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:36:54,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:36:54,801 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 2 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:36:54,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1151 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 20:36:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:36:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-27 20:36:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 147 states have (on average 1.129251700680272) internal successors, (166), 149 states have internal predecessors, (166), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:36:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2024-11-27 20:36:54,822 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 208 [2024-11-27 20:36:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:36:54,822 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2024-11-27 20:36:54,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:36:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2024-11-27 20:36:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-27 20:36:54,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:36:54,828 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:36:54,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 20:36:54,828 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:36:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:36:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1063718843, now seen corresponding path program 1 times [2024-11-27 20:36:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:36:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187594652] [2024-11-27 20:36:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:36:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:37:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:37:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:37:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:37:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187594652] [2024-11-27 20:37:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187594652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:37:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:37:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:37:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337952426] [2024-11-27 20:37:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:37:06,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:37:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:37:06,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:37:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:37:06,537 INFO L87 Difference]: Start difference. First operand 201 states and 234 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:37:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:37:08,041 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2024-11-27 20:37:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:37:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 208 [2024-11-27 20:37:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:37:08,045 INFO L225 Difference]: With dead ends: 349 [2024-11-27 20:37:08,045 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:37:08,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:37:08,046 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 7 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:37:08,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 909 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 20:37:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:37:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-27 20:37:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 147 states have (on average 1.1224489795918366) internal successors, (165), 149 states have internal predecessors, (165), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:37:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2024-11-27 20:37:08,057 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 208 [2024-11-27 20:37:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:37:08,057 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2024-11-27 20:37:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:37:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2024-11-27 20:37:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-27 20:37:08,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:37:08,060 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:37:08,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 20:37:08,060 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:37:08,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:37:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1893044737, now seen corresponding path program 1 times [2024-11-27 20:37:08,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:37:08,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409961276] [2024-11-27 20:37:08,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:37:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:37:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:37:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:37:20,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:37:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409961276] [2024-11-27 20:37:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409961276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:37:20,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:37:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:37:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850223497] [2024-11-27 20:37:20,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:37:20,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:37:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:37:20,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:37:20,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:37:20,632 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:37:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:37:24,753 INFO L93 Difference]: Finished difference Result 351 states and 404 transitions. [2024-11-27 20:37:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:37:24,754 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), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 209 [2024-11-27 20:37:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:37:24,757 INFO L225 Difference]: With dead ends: 351 [2024-11-27 20:37:24,757 INFO L226 Difference]: Without dead ends: 206 [2024-11-27 20:37:24,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:37:24,759 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 7 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:37:24,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1600 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-27 20:37:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-27 20:37:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-27 20:37:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 152 states have (on average 1.118421052631579) internal successors, (170), 154 states have internal predecessors, (170), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:37:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2024-11-27 20:37:24,773 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 209 [2024-11-27 20:37:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:37:24,774 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2024-11-27 20:37:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:37:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2024-11-27 20:37:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-27 20:37:24,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:37:24,777 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:37:24,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 20:37:24,777 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:37:24,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:37:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1831650753, now seen corresponding path program 1 times [2024-11-27 20:37:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:37:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103417777] [2024-11-27 20:37:24,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:37:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:37:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:37:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-27 20:37:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:37:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103417777] [2024-11-27 20:37:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103417777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:37:37,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:37:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:37:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016406464] [2024-11-27 20:37:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:37:37,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:37:37,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:37:37,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:37:37,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:37:37,926 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:37:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:37:40,343 INFO L93 Difference]: Finished difference Result 350 states and 400 transitions. [2024-11-27 20:37:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:37:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 209 [2024-11-27 20:37:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:37:40,346 INFO L225 Difference]: With dead ends: 350 [2024-11-27 20:37:40,346 INFO L226 Difference]: Without dead ends: 206 [2024-11-27 20:37:40,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:37:40,347 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 8 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:37:40,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1239 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-27 20:37:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-27 20:37:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-11-27 20:37:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.1066666666666667) internal successors, (166), 152 states have internal predecessors, (166), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-27 20:37:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 234 transitions. [2024-11-27 20:37:40,358 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 234 transitions. Word has length 209 [2024-11-27 20:37:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:37:40,359 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 234 transitions. [2024-11-27 20:37:40,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-27 20:37:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 234 transitions. [2024-11-27 20:37:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-27 20:37:40,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:37:40,361 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:37:40,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 20:37:40,361 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:37:40,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:37:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash 894245850, now seen corresponding path program 1 times [2024-11-27 20:37:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:37:40,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906545070] [2024-11-27 20:37:40,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:37:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:37:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:39:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-27 20:39:05,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:39:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906545070] [2024-11-27 20:39:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906545070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:39:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595074932] [2024-11-27 20:39:05,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:05,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:05,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:05,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c673972b-1e62-49ef-9050-346821baaa84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:39:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:39:15,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 228 conjuncts are in the unsatisfiable core [2024-11-27 20:39:16,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:39:16,339 INFO L378 Elim1Store]: Elim1 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 [2024-11-27 20:39:17,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-27 20:39:35,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:39:37,477 INFO L349 Elim1Store]: treesize reduction 61, result has 21.8 percent of original size [2024-11-27 20:39:37,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2024-11-27 20:39:39,683 INFO L349 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2024-11-27 20:39:39,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2024-11-27 20:39:41,902 INFO L349 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2024-11-27 20:39:41,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 78 [2024-11-27 20:39:45,318 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 20:39:45,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 20:39:47,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2024-11-27 20:39:47,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-27 20:39:54,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse0 (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select |c_old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (.cse2 (= (store |c_old(#memory_int)| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|))) (or (and .cse0 (= .cse1 |c_hash_table_state_required_bytes_#in~required_bytes.base|) .cse2) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_4| .cse3))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 |c_hash_table_state_required_bytes_#in~required_bytes.base|)))) (and (or (and .cse0 (= |c_old(#memory_int)| |c_#memory_int|)) (= (select |c_old(#valid)| .cse1) 0)) .cse2)))) is different from false [2024-11-27 20:39:54,826 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse0 (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select |c_old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (.cse2 (= (store |c_old(#memory_int)| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|))) (or (and .cse0 (= .cse1 |c_hash_table_state_required_bytes_#in~required_bytes.base|) .cse2) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_4| .cse3))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 |c_hash_table_state_required_bytes_#in~required_bytes.base|)))) (and (or (and .cse0 (= |c_old(#memory_int)| |c_#memory_int|)) (= (select |c_old(#valid)| .cse1) 0)) .cse2)))) is different from true [2024-11-27 20:39:56,290 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-27 20:39:56,317 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-27 20:39:57,595 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:39:57,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-11-27 20:39:58,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:39:58,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2024-11-27 20:39:59,292 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:39:59,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-27 20:39:59,485 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse0 .cse1)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse2 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2)))))) is different from false [2024-11-27 20:39:59,520 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse0 .cse1)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse2 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2)))))) is different from true [2024-11-27 20:40:01,882 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-27 20:40:01,920 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-27 20:40:02,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:02,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2024-11-27 20:40:03,652 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:40:03,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-11-27 20:40:03,758 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:40:03,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-27 20:40:07,974 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse0 .cse1)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse2 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse4 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse3 .cse4)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse4 (select |v_old(#memory_int)_AFTER_CALL_4| .cse4)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse5 (select |c_#memory_int| .cse5))) |c_#memory_int|)))) is different from false [2024-11-27 20:40:08,006 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse0 .cse1)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse2 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse4 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse3 .cse4)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse4 (select |v_old(#memory_int)_AFTER_CALL_4| .cse4)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse5 (select |c_#memory_int| .cse5))) |c_#memory_int|)))) is different from true [2024-11-27 20:40:13,530 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse7 .cse8)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |v_old(#memory_int)_AFTER_CALL_4| .cse8)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse9 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse9 (select |c_#memory_int| .cse9))) |c_#memory_int|))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-27 20:40:13,580 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse7 .cse8)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |v_old(#memory_int)_AFTER_CALL_4| .cse8)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse9 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse9 (select |c_#memory_int| .cse9))) |c_#memory_int|))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-27 20:40:15,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:15,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2024-11-27 20:40:16,077 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:40:16,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-11-27 20:40:16,185 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:40:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-27 20:40:20,279 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse0 .cse1)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse2 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse4 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse4 (select |v_old(#memory_int)_AFTER_CALL_4| .cse4)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse3 .cse4))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse5 (select |c_#memory_int| .cse5))) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse6 .cse7)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse7 (select |v_old(#memory_int)_AFTER_CALL_4| .cse7)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |c_#memory_int| .cse8))) |c_#memory_int|)))) is different from false [2024-11-27 20:40:20,322 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse0 .cse1)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse2 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse4 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse4 (select |v_old(#memory_int)_AFTER_CALL_4| .cse4)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse3 .cse4))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse5 (select |c_#memory_int| .cse5))) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse6 .cse7)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse7 (select |v_old(#memory_int)_AFTER_CALL_4| .cse7)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |c_#memory_int| .cse8))) |c_#memory_int|)))) is different from true [2024-11-27 20:40:26,276 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse8 (select |v_old(#memory_int)_AFTER_CALL_4| .cse8)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse7 .cse8))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse9 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse9 (select |c_#memory_int| .cse9))) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse10 .cse11)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse10 (select |c_#memory_int| .cse10)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |v_old(#memory_int)_AFTER_CALL_4| .cse11)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |c_#memory_int| .cse12))) |c_#memory_int|))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-27 20:40:26,345 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse8 (select |v_old(#memory_int)_AFTER_CALL_4| .cse8)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse7 .cse8))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse9 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse9 (select |c_#memory_int| .cse9))) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse10 .cse11)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse10 (select |c_#memory_int| .cse10)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |v_old(#memory_int)_AFTER_CALL_4| .cse11)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |c_#memory_int| .cse12))) |c_#memory_int|))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-27 20:40:26,667 INFO L378 Elim1Store]: Elim1 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 [2024-11-27 20:40:31,303 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (<= |c_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.offset| 0) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse8 (select |v_old(#memory_int)_AFTER_CALL_4| .cse8)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse7 .cse8))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse9 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse9 (select |c_#memory_int| .cse9))) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse10 .cse11)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse10 (select |c_#memory_int| .cse10)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |v_old(#memory_int)_AFTER_CALL_4| .cse11)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |c_#memory_int| .cse12))) |c_#memory_int|))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= (select |c_#valid| |c_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-27 20:40:31,371 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse3 (= (store |c_old(#memory_int)| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (select |c_old(#valid)| .cse0) 0) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1))) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (store |c_old(#valid)| .cse0 1) .cse1) 0)))) (and (or (and (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse2) 0) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|))))) .cse3) (and (exists ((|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (= (select (store |c_old(#valid)| .cse2 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) .cse3 (= (select |c_old(#valid)| .cse2) 0))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse5 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse4 .cse5)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse5 (select |v_old(#memory_int)_AFTER_CALL_4| .cse5)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_#memory_int| (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))) (<= |c_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.offset| 0) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse8 (select |v_old(#memory_int)_AFTER_CALL_4| .cse8)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse7 .cse8))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse9 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse9 (select |c_#memory_int| .cse9))) |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_#memory_int|)) (.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (not (= .cse10 .cse11)) (= (store |v_old(#memory_int)_AFTER_CALL_4| .cse10 (select |c_#memory_int| .cse10)) |c_#memory_int|) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |v_old(#memory_int)_AFTER_CALL_4| .cse11)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |c_#memory_int| .cse12))) |c_#memory_int|))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= (select |c_#valid| |c_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-27 20:40:37,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:37,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 130 treesize of output 311 [2024-11-27 20:42:05,627 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_4| .cse0))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_49|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_49| |v_#memory_int_BEFORE_CALL_9|)) (.cse5 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse2 .cse1)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse2 (select |v_#memory_int_BEFORE_CALL_9| .cse2)))))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |v_#memory_int_BEFORE_CALL_9| .cse3)))) (= (store |v_old(#memory_int)_AFTER_CALL_49| .cse4 (select |v_#memory_int_BEFORE_CALL_9| .cse4)) |v_#memory_int_BEFORE_CALL_9|) (= (select (store |c_old(#valid)| .cse5 1) .cse0) 0) (not (= .cse4 .cse6)) (= (select |c_old(#valid)| .cse5) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse5 (select |v_#memory_int_BEFORE_CALL_9| .cse5)))))) (= |v_old(#memory_int)_AFTER_CALL_49| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse6 (select |v_old(#memory_int)_AFTER_CALL_49| .cse6))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse7 (select |v_old(#memory_int)_AFTER_CALL_4| .cse7))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_79| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_79|))) (and (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse9 (@diff |v_old(#memory_int)_AFTER_CALL_79| |v_#memory_int_BEFORE_CALL_9|)) (.cse11 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse8 .cse9)) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse10 (select |v_#memory_int_BEFORE_CALL_9| .cse10))) (not (= .cse11 .cse7)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |v_#memory_int_BEFORE_CALL_9| .cse12))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse10) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= (store |v_old(#memory_int)_AFTER_CALL_79| .cse9 (select |v_#memory_int_BEFORE_CALL_9| .cse9)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse11 (select |v_#memory_int_BEFORE_CALL_9| .cse11)))))) (= |v_old(#memory_int)_AFTER_CALL_79| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse8 (select |v_old(#memory_int)_AFTER_CALL_79| .cse8))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))) (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse14 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse13 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse13 (select |v_#memory_int_BEFORE_CALL_9| .cse13))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse14 (select |v_#memory_int_BEFORE_CALL_9| .cse14))) (= (select |c_old(#valid)| .cse14) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse15 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse15 (select |v_#memory_int_BEFORE_CALL_9| .cse15)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse16 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse16 (select |v_#memory_int_BEFORE_CALL_9| .cse16))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse14 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse20 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse17 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_35|))) (and (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse17 (select |v_old(#memory_int)_AFTER_CALL_35| .cse17))) (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse18 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse21 (@diff |v_old(#memory_int)_AFTER_CALL_35| |v_#memory_int_BEFORE_CALL_9|)) (.cse19 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse18 (select |v_#memory_int_BEFORE_CALL_9| .cse18))) (= (select |c_old(#valid)| .cse18) 0) (not (= .cse19 .cse20)) (not (= .cse17 .cse21)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse22 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse22 (select |v_#memory_int_BEFORE_CALL_9| .cse22))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse18 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_35| .cse21 (select |v_#memory_int_BEFORE_CALL_9| .cse21))) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse19 (select |v_#memory_int_BEFORE_CALL_9| .cse19))))))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse20 (select |v_old(#memory_int)_AFTER_CALL_4| .cse20)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse24 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse23 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse23 (select |v_#memory_int_BEFORE_CALL_9| .cse23))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse24 (select |v_#memory_int_BEFORE_CALL_9| .cse24))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse25 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse25 (select |v_#memory_int_BEFORE_CALL_9| .cse25)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse26 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse26 (select |v_#memory_int_BEFORE_CALL_9| .cse26))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse24) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse27 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_old(#memory_int)|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse27 (select |c_old(#memory_int)| .cse27))) |c_old(#memory_int)|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse29 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse28 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_old(#memory_int)|))) (and (= |c_old(#memory_int)| (store |v_old(#memory_int)_AFTER_CALL_4| .cse28 (select |c_old(#memory_int)| .cse28))) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse29 (select |v_old(#memory_int)_AFTER_CALL_4| .cse29)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse29 .cse28)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_old(#memory_int)| (let ((.cse30 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_old(#memory_int)|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse30 (select |c_old(#memory_int)| .cse30))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse31 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_old(#memory_int)|)) (.cse32 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |c_old(#memory_int)| (store |v_old(#memory_int)_AFTER_CALL_4| .cse31 (select |c_old(#memory_int)| .cse31))) (not (= .cse32 .cse31)) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse32 (select |v_old(#memory_int)_AFTER_CALL_4| .cse32))))))) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (= (store |c_old(#memory_int)| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |c_old(#memory_int)| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse33 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_old(#memory_int)|)) (.cse34 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |c_old(#memory_int)| (store |v_old(#memory_int)_AFTER_CALL_4| .cse33 (select |c_old(#memory_int)| .cse33))) (not (= .cse34 .cse33)) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse34 (select |v_old(#memory_int)_AFTER_CALL_4| .cse34)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse35 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_old(#memory_int)|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse35 (select |c_old(#memory_int)| .cse35))) |c_old(#memory_int)|))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse36 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse36 (select |v_old(#memory_int)_AFTER_CALL_4| .cse36))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse40 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse37 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse37 (select |v_#memory_int_BEFORE_CALL_9| .cse37))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse38 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse38 (select |v_#memory_int_BEFORE_CALL_9| .cse38)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse39 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse39 (select |v_#memory_int_BEFORE_CALL_9| .cse39))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse40 1) .cse36) 0) (= (select |c_old(#valid)| .cse40) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse40 (select |v_#memory_int_BEFORE_CALL_9| .cse40))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse41 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse41 (select |v_old(#memory_int)_AFTER_CALL_4| .cse41))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse43 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse44 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse42 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse42 (select |v_#memory_int_BEFORE_CALL_9| .cse42))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse43 (select |v_#memory_int_BEFORE_CALL_9| .cse43))) (not (= .cse44 .cse41)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse45 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse45 (select |v_#memory_int_BEFORE_CALL_9| .cse45))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse43) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse44 (select |v_#memory_int_BEFORE_CALL_9| .cse44))))))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse46 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse46 (select |v_old(#memory_int)_AFTER_CALL_4| .cse46))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse48 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse49 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse47 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse47 (select |v_#memory_int_BEFORE_CALL_9| .cse47))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse48 (select |v_#memory_int_BEFORE_CALL_9| .cse48))) (= (select |c_old(#valid)| .cse48) 0) (not (= .cse49 .cse46)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse50 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse50 (select |v_#memory_int_BEFORE_CALL_9| .cse50))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse48 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse49 (select |v_#memory_int_BEFORE_CALL_9| .cse49))))))))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse51 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse51 (select |v_old(#memory_int)_AFTER_CALL_4| .cse51))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse52 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse52 (select |v_old(#memory_int)_AFTER_CALL_53| .cse52))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int)))) (let ((.cse54 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_55|))) (and (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse53 (@diff |v_old(#memory_int)_AFTER_CALL_55| |v_#memory_int_BEFORE_CALL_9|)) (.cse55 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse57 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse53 .cse54)) (= (store |v_old(#memory_int)_AFTER_CALL_55| .cse53 (select |v_#memory_int_BEFORE_CALL_9| .cse53)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse55 (select |v_#memory_int_BEFORE_CALL_9| .cse55))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse56 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse56 (select |v_#memory_int_BEFORE_CALL_9| .cse56))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse57 1) .cse51) 0) (= (select |c_old(#valid)| .cse57) 0) (not (= .cse55 .cse52)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse57 (select |v_#memory_int_BEFORE_CALL_9| .cse57)))))) (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse54 (select |v_old(#memory_int)_AFTER_CALL_55| .cse54)))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse61 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse58 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse59 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse58 (select |v_old(#memory_int)_AFTER_CALL_4| .cse58)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse59 .cse58)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse59 (select |v_#memory_int_BEFORE_CALL_9| .cse59)))))) (= (let ((.cse60 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse60 (select |v_#memory_int_BEFORE_CALL_9| .cse60))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse61 (select |v_#memory_int_BEFORE_CALL_9| .cse61))) (= (select |c_old(#valid)| .cse61) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse62 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse62 (select |v_#memory_int_BEFORE_CALL_9| .cse62)))) (= (select (store |c_old(#valid)| .cse61 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse63 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse63 (select |v_old(#memory_int)_AFTER_CALL_4| .cse63)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse66 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse68 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse64 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse65 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse64 (select |v_old(#memory_int)_AFTER_CALL_4| .cse64)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse65 .cse64)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse65 (select |v_#memory_int_BEFORE_CALL_9| .cse65)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse66 (select |v_#memory_int_BEFORE_CALL_9| .cse66))) (= (select |c_old(#valid)| .cse66) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse67 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse67 (select |v_#memory_int_BEFORE_CALL_9| .cse67)))) (= (select (store |c_old(#valid)| .cse66 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (not (= .cse68 .cse63)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse68 (select |v_#memory_int_BEFORE_CALL_9| .cse68))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse69 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse69 (select |v_old(#memory_int)_AFTER_CALL_4| .cse69))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse76 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int)))) (let ((.cse70 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_55|))) (and (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse70 (select |v_old(#memory_int)_AFTER_CALL_55| .cse70))) (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse71 (@diff |v_old(#memory_int)_AFTER_CALL_55| |v_#memory_int_BEFORE_CALL_9|)) (.cse74 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse75 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse71 .cse70)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse72 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse73 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse72 (select |v_old(#memory_int)_AFTER_CALL_4| .cse72)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse73 .cse72)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse73 (select |v_#memory_int_BEFORE_CALL_9| .cse73)))))) (= (store |v_old(#memory_int)_AFTER_CALL_55| .cse71 (select |v_#memory_int_BEFORE_CALL_9| .cse71)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse74 (select |v_#memory_int_BEFORE_CALL_9| .cse74))) (= (select (store |c_old(#valid)| .cse75 1) .cse69) 0) (= (select |c_old(#valid)| .cse75) 0) (not (= .cse74 .cse76)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse75 (select |v_#memory_int_BEFORE_CALL_9| .cse75))))))))) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse76 (select |v_old(#memory_int)_AFTER_CALL_53| .cse76))))))))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse77 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse77 (select |v_old(#memory_int)_AFTER_CALL_4| .cse77))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse78 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse78 (select |v_old(#memory_int)_AFTER_CALL_53| .cse78))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse80 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse82 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse79 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse79 (select |v_#memory_int_BEFORE_CALL_9| .cse79))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse80 (select |v_#memory_int_BEFORE_CALL_9| .cse80))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse81 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse81 (select |v_#memory_int_BEFORE_CALL_9| .cse81))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse82 1) .cse77) 0) (= (select |c_old(#valid)| .cse82) 0) (not (= .cse80 .cse78)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse82 (select |v_#memory_int_BEFORE_CALL_9| .cse82)))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse83 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse83 (select |v_old(#memory_int)_AFTER_CALL_4| .cse83))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse84 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_49|))) (and (= |v_old(#memory_int)_AFTER_CALL_49| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse84 (select |v_old(#memory_int)_AFTER_CALL_49| .cse84))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse86 (@diff |v_old(#memory_int)_AFTER_CALL_49| |v_#memory_int_BEFORE_CALL_9|)) (.cse88 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse85 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse85 (select |v_#memory_int_BEFORE_CALL_9| .cse85)))) (= (store |v_old(#memory_int)_AFTER_CALL_49| .cse86 (select |v_#memory_int_BEFORE_CALL_9| .cse86)) |v_#memory_int_BEFORE_CALL_9|) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse87 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse87 (select |v_#memory_int_BEFORE_CALL_9| .cse87))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse88 1) .cse83) 0) (not (= .cse86 .cse84)) (= (select |c_old(#valid)| .cse88) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse88 (select |v_#memory_int_BEFORE_CALL_9| .cse88)))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse95 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_79| (Array Int (Array Int Int)))) (let ((.cse89 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_79|))) (and (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse93 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse90 (@diff |v_old(#memory_int)_AFTER_CALL_79| |v_#memory_int_BEFORE_CALL_9|)) (.cse94 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse89 .cse90)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse91 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse92 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse91 (select |v_old(#memory_int)_AFTER_CALL_4| .cse91)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse92 .cse91)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse92 (select |v_#memory_int_BEFORE_CALL_9| .cse92)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse93 (select |v_#memory_int_BEFORE_CALL_9| .cse93))) (not (= .cse94 .cse95)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse93) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= (store |v_old(#memory_int)_AFTER_CALL_79| .cse90 (select |v_#memory_int_BEFORE_CALL_9| .cse90)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse94 (select |v_#memory_int_BEFORE_CALL_9| .cse94)))))) (= |v_old(#memory_int)_AFTER_CALL_79| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse89 (select |v_old(#memory_int)_AFTER_CALL_79| .cse89)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse95 (select |v_old(#memory_int)_AFTER_CALL_4| .cse95)))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse96 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse96 (select |v_old(#memory_int)_AFTER_CALL_4| .cse96)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse97 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse100 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse97 (select |v_#memory_int_BEFORE_CALL_9| .cse97))) (= (select |c_old(#valid)| .cse97) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse98 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse98 (select |v_#memory_int_BEFORE_CALL_9| .cse98)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse99 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse99 (select |v_#memory_int_BEFORE_CALL_9| .cse99))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse97 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (not (= .cse100 .cse96)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse100 (select |v_#memory_int_BEFORE_CALL_9| .cse100))))))))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse106 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse101 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_35|))) (and (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse101 (select |v_old(#memory_int)_AFTER_CALL_35| .cse101))) (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse104 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse107 (@diff |v_old(#memory_int)_AFTER_CALL_35| |v_#memory_int_BEFORE_CALL_9|)) (.cse105 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse102 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse103 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse102 (select |v_old(#memory_int)_AFTER_CALL_4| .cse102)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse103 .cse102)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse103 (select |v_#memory_int_BEFORE_CALL_9| .cse103)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse104 (select |v_#memory_int_BEFORE_CALL_9| .cse104))) (= (select |c_old(#valid)| .cse104) 0) (not (= .cse105 .cse106)) (not (= .cse101 .cse107)) (= (select (store |c_old(#valid)| .cse104 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_35| .cse107 (select |v_#memory_int_BEFORE_CALL_9| .cse107))) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse105 (select |v_#memory_int_BEFORE_CALL_9| .cse105))))))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse106 (select |v_old(#memory_int)_AFTER_CALL_4| .cse106)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse113 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse111 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse112 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse108 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse109 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse108 (select |v_old(#memory_int)_AFTER_CALL_4| .cse108)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse109 .cse108)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse109 (select |v_#memory_int_BEFORE_CALL_9| .cse109)))))) (= (let ((.cse110 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse110 (select |v_#memory_int_BEFORE_CALL_9| .cse110))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse111 (select |v_#memory_int_BEFORE_CALL_9| .cse111))) (not (= .cse112 .cse113)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse111) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse112 (select |v_#memory_int_BEFORE_CALL_9| .cse112)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse113 (select |v_old(#memory_int)_AFTER_CALL_4| .cse113)))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse119 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse117 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse118 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse114 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse115 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse114 (select |v_old(#memory_int)_AFTER_CALL_4| .cse114)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse115 .cse114)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse115 (select |v_#memory_int_BEFORE_CALL_9| .cse115)))))) (= (let ((.cse116 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse116 (select |v_#memory_int_BEFORE_CALL_9| .cse116))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse117 (select |v_#memory_int_BEFORE_CALL_9| .cse117))) (= (select |c_old(#valid)| .cse117) 0) (not (= .cse118 .cse119)) (= (select (store |c_old(#valid)| .cse117 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse118 (select |v_#memory_int_BEFORE_CALL_9| .cse118)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse119 (select |v_old(#memory_int)_AFTER_CALL_4| .cse119)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse120 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse120 (select |v_old(#memory_int)_AFTER_CALL_4| .cse120)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse123 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse125 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse121 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse122 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse121 (select |v_old(#memory_int)_AFTER_CALL_4| .cse121)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse122 .cse121)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse122 (select |v_#memory_int_BEFORE_CALL_9| .cse122)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse123 (select |v_#memory_int_BEFORE_CALL_9| .cse123))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse124 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse124 (select |v_#memory_int_BEFORE_CALL_9| .cse124)))) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse123) 0) (not (= .cse125 .cse120)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse125 (select |v_#memory_int_BEFORE_CALL_9| .cse125))))))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse131 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse130 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse126 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse127 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse126 (select |v_old(#memory_int)_AFTER_CALL_4| .cse126)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse127 .cse126)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse127 (select |v_#memory_int_BEFORE_CALL_9| .cse127)))))) (= (let ((.cse128 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse128 (select |v_#memory_int_BEFORE_CALL_9| .cse128))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse129 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse129 (select |v_#memory_int_BEFORE_CALL_9| .cse129)))) (= (select (store |c_old(#valid)| .cse130 1) .cse131) 0) (= (select |c_old(#valid)| .cse130) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse130 (select |v_#memory_int_BEFORE_CALL_9| .cse130)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse131 (select |v_old(#memory_int)_AFTER_CALL_4| .cse131)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse132 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse132 (select |v_old(#memory_int)_AFTER_CALL_4| .cse132)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse133 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse136 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse133 (select |v_#memory_int_BEFORE_CALL_9| .cse133))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse134 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse134 (select |v_#memory_int_BEFORE_CALL_9| .cse134)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse135 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse135 (select |v_#memory_int_BEFORE_CALL_9| .cse135))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse133) 0) (not (= .cse136 .cse132)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse136 (select |v_#memory_int_BEFORE_CALL_9| .cse136))))))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse140 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse137 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse138 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse137 (select |v_old(#memory_int)_AFTER_CALL_4| .cse137)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse138 .cse137)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse138 (select |v_#memory_int_BEFORE_CALL_9| .cse138)))))) (= (let ((.cse139 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse139 (select |v_#memory_int_BEFORE_CALL_9| .cse139))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse140 (select |v_#memory_int_BEFORE_CALL_9| .cse140))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse141 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse141 (select |v_#memory_int_BEFORE_CALL_9| .cse141)))) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse140) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse142 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse142 (select |v_old(#memory_int)_AFTER_CALL_4| .cse142))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse148 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse146 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse147 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse143 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse144 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse143 (select |v_old(#memory_int)_AFTER_CALL_4| .cse143)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse144 .cse143)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse144 (select |v_#memory_int_BEFORE_CALL_9| .cse144)))))) (= (let ((.cse145 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse145 (select |v_#memory_int_BEFORE_CALL_9| .cse145))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse146 (select |v_#memory_int_BEFORE_CALL_9| .cse146))) (= (select (store |c_old(#valid)| .cse147 1) .cse142) 0) (= (select |c_old(#valid)| .cse147) 0) (not (= .cse146 .cse148)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse147 (select |v_#memory_int_BEFORE_CALL_9| .cse147)))))) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse148 (select |v_old(#memory_int)_AFTER_CALL_53| .cse148))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1)))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|) (exists ((|v_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base_BEFORE_CALL_1| Int)) (= (select |c_#valid| |v_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base_BEFORE_CALL_1|) 1))) is different from false [2024-11-27 20:42:05,880 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_4| .cse0))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_49|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_49| |v_#memory_int_BEFORE_CALL_9|)) (.cse5 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse1 (select |v_old(#memory_int)_AFTER_CALL_4| .cse1)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse2 .cse1)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse2 (select |v_#memory_int_BEFORE_CALL_9| .cse2)))))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |v_#memory_int_BEFORE_CALL_9| .cse3)))) (= (store |v_old(#memory_int)_AFTER_CALL_49| .cse4 (select |v_#memory_int_BEFORE_CALL_9| .cse4)) |v_#memory_int_BEFORE_CALL_9|) (= (select (store |c_old(#valid)| .cse5 1) .cse0) 0) (not (= .cse4 .cse6)) (= (select |c_old(#valid)| .cse5) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse5 (select |v_#memory_int_BEFORE_CALL_9| .cse5)))))) (= |v_old(#memory_int)_AFTER_CALL_49| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse6 (select |v_old(#memory_int)_AFTER_CALL_49| .cse6))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse7 (select |v_old(#memory_int)_AFTER_CALL_4| .cse7))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_79| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_79|))) (and (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse9 (@diff |v_old(#memory_int)_AFTER_CALL_79| |v_#memory_int_BEFORE_CALL_9|)) (.cse11 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse8 .cse9)) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse10 (select |v_#memory_int_BEFORE_CALL_9| .cse10))) (not (= .cse11 .cse7)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |v_#memory_int_BEFORE_CALL_9| .cse12))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse10) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= (store |v_old(#memory_int)_AFTER_CALL_79| .cse9 (select |v_#memory_int_BEFORE_CALL_9| .cse9)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse11 (select |v_#memory_int_BEFORE_CALL_9| .cse11)))))) (= |v_old(#memory_int)_AFTER_CALL_79| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse8 (select |v_old(#memory_int)_AFTER_CALL_79| .cse8))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))) (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse14 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse13 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse13 (select |v_#memory_int_BEFORE_CALL_9| .cse13))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse14 (select |v_#memory_int_BEFORE_CALL_9| .cse14))) (= (select |c_old(#valid)| .cse14) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse15 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse15 (select |v_#memory_int_BEFORE_CALL_9| .cse15)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse16 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse16 (select |v_#memory_int_BEFORE_CALL_9| .cse16))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse14 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse20 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse17 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_35|))) (and (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse17 (select |v_old(#memory_int)_AFTER_CALL_35| .cse17))) (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse18 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse21 (@diff |v_old(#memory_int)_AFTER_CALL_35| |v_#memory_int_BEFORE_CALL_9|)) (.cse19 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse18 (select |v_#memory_int_BEFORE_CALL_9| .cse18))) (= (select |c_old(#valid)| .cse18) 0) (not (= .cse19 .cse20)) (not (= .cse17 .cse21)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse22 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse22 (select |v_#memory_int_BEFORE_CALL_9| .cse22))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse18 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_35| .cse21 (select |v_#memory_int_BEFORE_CALL_9| .cse21))) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse19 (select |v_#memory_int_BEFORE_CALL_9| .cse19))))))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse20 (select |v_old(#memory_int)_AFTER_CALL_4| .cse20)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse24 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse23 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse23 (select |v_#memory_int_BEFORE_CALL_9| .cse23))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse24 (select |v_#memory_int_BEFORE_CALL_9| .cse24))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse25 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse25 (select |v_#memory_int_BEFORE_CALL_9| .cse25)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse26 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse26 (select |v_#memory_int_BEFORE_CALL_9| .cse26))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse24) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int)))) (= (let ((.cse27 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_old(#memory_int)|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse27 (select |c_old(#memory_int)| .cse27))) |c_old(#memory_int)|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse29 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse28 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_old(#memory_int)|))) (and (= |c_old(#memory_int)| (store |v_old(#memory_int)_AFTER_CALL_4| .cse28 (select |c_old(#memory_int)| .cse28))) (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse29 (select |v_old(#memory_int)_AFTER_CALL_4| .cse29)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse29 .cse28)))))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int)))) (= |c_old(#memory_int)| (let ((.cse30 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_old(#memory_int)|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse30 (select |c_old(#memory_int)| .cse30))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse31 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_old(#memory_int)|)) (.cse32 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |c_old(#memory_int)| (store |v_old(#memory_int)_AFTER_CALL_4| .cse31 (select |c_old(#memory_int)| .cse31))) (not (= .cse32 .cse31)) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse32 (select |v_old(#memory_int)_AFTER_CALL_4| .cse32))))))) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (= (store |c_old(#memory_int)| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |c_old(#memory_int)| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse33 (@diff |v_old(#memory_int)_AFTER_CALL_4| |c_old(#memory_int)|)) (.cse34 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |c_old(#memory_int)| (store |v_old(#memory_int)_AFTER_CALL_4| .cse33 (select |c_old(#memory_int)| .cse33))) (not (= .cse34 .cse33)) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse34 (select |v_old(#memory_int)_AFTER_CALL_4| .cse34)) |v_old(#memory_int)_AFTER_CALL_4|)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse35 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_old(#memory_int)|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse35 (select |c_old(#memory_int)| .cse35))) |c_old(#memory_int)|))) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0)))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse36 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse36 (select |v_old(#memory_int)_AFTER_CALL_4| .cse36))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse40 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse37 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse37 (select |v_#memory_int_BEFORE_CALL_9| .cse37))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse38 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse38 (select |v_#memory_int_BEFORE_CALL_9| .cse38)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse39 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse39 (select |v_#memory_int_BEFORE_CALL_9| .cse39))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse40 1) .cse36) 0) (= (select |c_old(#valid)| .cse40) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse40 (select |v_#memory_int_BEFORE_CALL_9| .cse40))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse41 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse41 (select |v_old(#memory_int)_AFTER_CALL_4| .cse41))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse43 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse44 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse42 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse42 (select |v_#memory_int_BEFORE_CALL_9| .cse42))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse43 (select |v_#memory_int_BEFORE_CALL_9| .cse43))) (not (= .cse44 .cse41)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse45 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse45 (select |v_#memory_int_BEFORE_CALL_9| .cse45))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse43) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse44 (select |v_#memory_int_BEFORE_CALL_9| .cse44))))))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse46 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse46 (select |v_old(#memory_int)_AFTER_CALL_4| .cse46))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse48 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse49 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse47 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse47 (select |v_#memory_int_BEFORE_CALL_9| .cse47))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse48 (select |v_#memory_int_BEFORE_CALL_9| .cse48))) (= (select |c_old(#valid)| .cse48) 0) (not (= .cse49 .cse46)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse50 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse50 (select |v_#memory_int_BEFORE_CALL_9| .cse50))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse48 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse49 (select |v_#memory_int_BEFORE_CALL_9| .cse49))))))))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse51 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse51 (select |v_old(#memory_int)_AFTER_CALL_4| .cse51))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse52 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse52 (select |v_old(#memory_int)_AFTER_CALL_53| .cse52))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int)))) (let ((.cse54 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_55|))) (and (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse53 (@diff |v_old(#memory_int)_AFTER_CALL_55| |v_#memory_int_BEFORE_CALL_9|)) (.cse55 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse57 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse53 .cse54)) (= (store |v_old(#memory_int)_AFTER_CALL_55| .cse53 (select |v_#memory_int_BEFORE_CALL_9| .cse53)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse55 (select |v_#memory_int_BEFORE_CALL_9| .cse55))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse56 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse56 (select |v_#memory_int_BEFORE_CALL_9| .cse56))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse57 1) .cse51) 0) (= (select |c_old(#valid)| .cse57) 0) (not (= .cse55 .cse52)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse57 (select |v_#memory_int_BEFORE_CALL_9| .cse57)))))) (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse54 (select |v_old(#memory_int)_AFTER_CALL_55| .cse54)))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse61 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse58 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse59 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse58 (select |v_old(#memory_int)_AFTER_CALL_4| .cse58)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse59 .cse58)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse59 (select |v_#memory_int_BEFORE_CALL_9| .cse59)))))) (= (let ((.cse60 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse60 (select |v_#memory_int_BEFORE_CALL_9| .cse60))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse61 (select |v_#memory_int_BEFORE_CALL_9| .cse61))) (= (select |c_old(#valid)| .cse61) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse62 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse62 (select |v_#memory_int_BEFORE_CALL_9| .cse62)))) (= (select (store |c_old(#valid)| .cse61 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse63 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse63 (select |v_old(#memory_int)_AFTER_CALL_4| .cse63)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse66 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse68 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse64 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse65 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse64 (select |v_old(#memory_int)_AFTER_CALL_4| .cse64)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse65 .cse64)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse65 (select |v_#memory_int_BEFORE_CALL_9| .cse65)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse66 (select |v_#memory_int_BEFORE_CALL_9| .cse66))) (= (select |c_old(#valid)| .cse66) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse67 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse67 (select |v_#memory_int_BEFORE_CALL_9| .cse67)))) (= (select (store |c_old(#valid)| .cse66 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (not (= .cse68 .cse63)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse68 (select |v_#memory_int_BEFORE_CALL_9| .cse68))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse69 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse69 (select |v_old(#memory_int)_AFTER_CALL_4| .cse69))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse76 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int)))) (let ((.cse70 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_55|))) (and (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse70 (select |v_old(#memory_int)_AFTER_CALL_55| .cse70))) (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse71 (@diff |v_old(#memory_int)_AFTER_CALL_55| |v_#memory_int_BEFORE_CALL_9|)) (.cse74 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse75 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse71 .cse70)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse72 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse73 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse72 (select |v_old(#memory_int)_AFTER_CALL_4| .cse72)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse73 .cse72)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse73 (select |v_#memory_int_BEFORE_CALL_9| .cse73)))))) (= (store |v_old(#memory_int)_AFTER_CALL_55| .cse71 (select |v_#memory_int_BEFORE_CALL_9| .cse71)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse74 (select |v_#memory_int_BEFORE_CALL_9| .cse74))) (= (select (store |c_old(#valid)| .cse75 1) .cse69) 0) (= (select |c_old(#valid)| .cse75) 0) (not (= .cse74 .cse76)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse75 (select |v_#memory_int_BEFORE_CALL_9| .cse75))))))))) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse76 (select |v_old(#memory_int)_AFTER_CALL_53| .cse76))))))))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse77 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse77 (select |v_old(#memory_int)_AFTER_CALL_4| .cse77))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse78 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse78 (select |v_old(#memory_int)_AFTER_CALL_53| .cse78))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse80 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse82 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (let ((.cse79 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse79 (select |v_#memory_int_BEFORE_CALL_9| .cse79))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse80 (select |v_#memory_int_BEFORE_CALL_9| .cse80))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse81 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse81 (select |v_#memory_int_BEFORE_CALL_9| .cse81))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse82 1) .cse77) 0) (= (select |c_old(#valid)| .cse82) 0) (not (= .cse80 .cse78)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse82 (select |v_#memory_int_BEFORE_CALL_9| .cse82)))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse83 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse83 (select |v_old(#memory_int)_AFTER_CALL_4| .cse83))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse84 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_49|))) (and (= |v_old(#memory_int)_AFTER_CALL_49| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse84 (select |v_old(#memory_int)_AFTER_CALL_49| .cse84))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse86 (@diff |v_old(#memory_int)_AFTER_CALL_49| |v_#memory_int_BEFORE_CALL_9|)) (.cse88 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse85 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse85 (select |v_#memory_int_BEFORE_CALL_9| .cse85)))) (= (store |v_old(#memory_int)_AFTER_CALL_49| .cse86 (select |v_#memory_int_BEFORE_CALL_9| .cse86)) |v_#memory_int_BEFORE_CALL_9|) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse87 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse87 (select |v_#memory_int_BEFORE_CALL_9| .cse87))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse88 1) .cse83) 0) (not (= .cse86 .cse84)) (= (select |c_old(#valid)| .cse88) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse88 (select |v_#memory_int_BEFORE_CALL_9| .cse88)))))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse95 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_79| (Array Int (Array Int Int)))) (let ((.cse89 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_79|))) (and (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse93 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse90 (@diff |v_old(#memory_int)_AFTER_CALL_79| |v_#memory_int_BEFORE_CALL_9|)) (.cse94 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (not (= .cse89 .cse90)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse91 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse92 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse91 (select |v_old(#memory_int)_AFTER_CALL_4| .cse91)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse92 .cse91)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse92 (select |v_#memory_int_BEFORE_CALL_9| .cse92)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse93 (select |v_#memory_int_BEFORE_CALL_9| .cse93))) (not (= .cse94 .cse95)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse93) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= (store |v_old(#memory_int)_AFTER_CALL_79| .cse90 (select |v_#memory_int_BEFORE_CALL_9| .cse90)) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse94 (select |v_#memory_int_BEFORE_CALL_9| .cse94)))))) (= |v_old(#memory_int)_AFTER_CALL_79| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse89 (select |v_old(#memory_int)_AFTER_CALL_79| .cse89)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse95 (select |v_old(#memory_int)_AFTER_CALL_4| .cse95)))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse96 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse96 (select |v_old(#memory_int)_AFTER_CALL_4| .cse96)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse97 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse100 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse97 (select |v_#memory_int_BEFORE_CALL_9| .cse97))) (= (select |c_old(#valid)| .cse97) 0) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse98 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse98 (select |v_#memory_int_BEFORE_CALL_9| .cse98)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse99 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse99 (select |v_#memory_int_BEFORE_CALL_9| .cse99))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| .cse97 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (not (= .cse100 .cse96)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse100 (select |v_#memory_int_BEFORE_CALL_9| .cse100))))))))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse106 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse101 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_35|))) (and (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse101 (select |v_old(#memory_int)_AFTER_CALL_35| .cse101))) (exists ((|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse104 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse107 (@diff |v_old(#memory_int)_AFTER_CALL_35| |v_#memory_int_BEFORE_CALL_9|)) (.cse105 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse102 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse103 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse102 (select |v_old(#memory_int)_AFTER_CALL_4| .cse102)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse103 .cse102)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse103 (select |v_#memory_int_BEFORE_CALL_9| .cse103)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse104 (select |v_#memory_int_BEFORE_CALL_9| .cse104))) (= (select |c_old(#valid)| .cse104) 0) (not (= .cse105 .cse106)) (not (= .cse101 .cse107)) (= (select (store |c_old(#valid)| .cse104 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_35| .cse107 (select |v_#memory_int_BEFORE_CALL_9| .cse107))) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse105 (select |v_#memory_int_BEFORE_CALL_9| .cse105))))))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse106 (select |v_old(#memory_int)_AFTER_CALL_4| .cse106)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse113 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse111 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse112 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse108 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse109 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse108 (select |v_old(#memory_int)_AFTER_CALL_4| .cse108)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse109 .cse108)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse109 (select |v_#memory_int_BEFORE_CALL_9| .cse109)))))) (= (let ((.cse110 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse110 (select |v_#memory_int_BEFORE_CALL_9| .cse110))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse111 (select |v_#memory_int_BEFORE_CALL_9| .cse111))) (not (= .cse112 .cse113)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse111) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse112 (select |v_#memory_int_BEFORE_CALL_9| .cse112)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse113 (select |v_old(#memory_int)_AFTER_CALL_4| .cse113)))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse119 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int))) (|hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse117 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse118 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse114 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse115 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse114 (select |v_old(#memory_int)_AFTER_CALL_4| .cse114)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse115 .cse114)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse115 (select |v_#memory_int_BEFORE_CALL_9| .cse115)))))) (= (let ((.cse116 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse116 (select |v_#memory_int_BEFORE_CALL_9| .cse116))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse117 (select |v_#memory_int_BEFORE_CALL_9| .cse117))) (= (select |c_old(#valid)| .cse117) 0) (not (= .cse118 .cse119)) (= (select (store |c_old(#valid)| .cse117 1) |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse118 (select |v_#memory_int_BEFORE_CALL_9| .cse118)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse119 (select |v_old(#memory_int)_AFTER_CALL_4| .cse119)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1) (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse120 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse120 (select |v_old(#memory_int)_AFTER_CALL_4| .cse120)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse123 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse125 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse121 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse122 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse121 (select |v_old(#memory_int)_AFTER_CALL_4| .cse121)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse122 .cse121)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse122 (select |v_#memory_int_BEFORE_CALL_9| .cse122)))))) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse123 (select |v_#memory_int_BEFORE_CALL_9| .cse123))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse124 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse124 (select |v_#memory_int_BEFORE_CALL_9| .cse124)))) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse123) 0) (not (= .cse125 .cse120)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse125 (select |v_#memory_int_BEFORE_CALL_9| .cse125))))))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse131 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse130 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse126 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse127 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse126 (select |v_old(#memory_int)_AFTER_CALL_4| .cse126)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse127 .cse126)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse127 (select |v_#memory_int_BEFORE_CALL_9| .cse127)))))) (= (let ((.cse128 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse128 (select |v_#memory_int_BEFORE_CALL_9| .cse128))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse129 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse129 (select |v_#memory_int_BEFORE_CALL_9| .cse129)))) (= (select (store |c_old(#valid)| .cse130 1) .cse131) 0) (= (select |c_old(#valid)| .cse130) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse130 (select |v_#memory_int_BEFORE_CALL_9| .cse130)))))) (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse131 (select |v_old(#memory_int)_AFTER_CALL_4| .cse131)))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse132 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse132 (select |v_old(#memory_int)_AFTER_CALL_4| .cse132)) |v_old(#memory_int)_AFTER_CALL_4|) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse133 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|)) (.cse136 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse133 (select |v_#memory_int_BEFORE_CALL_9| .cse133))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse134 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse134 (select |v_#memory_int_BEFORE_CALL_9| .cse134)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (= (let ((.cse135 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_7| .cse135 (select |v_#memory_int_BEFORE_CALL_9| .cse135))) |v_#memory_int_BEFORE_CALL_9|)) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse133) 0) (not (= .cse136 .cse132)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse136 (select |v_#memory_int_BEFORE_CALL_9| .cse136))))))))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse140 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse137 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse138 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse137 (select |v_old(#memory_int)_AFTER_CALL_4| .cse137)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse138 .cse137)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse138 (select |v_#memory_int_BEFORE_CALL_9| .cse138)))))) (= (let ((.cse139 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse139 (select |v_#memory_int_BEFORE_CALL_9| .cse139))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |c_old(#memory_int)| .cse140 (select |v_#memory_int_BEFORE_CALL_9| .cse140))) (= |v_#memory_int_BEFORE_CALL_9| (let ((.cse141 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_6| .cse141 (select |v_#memory_int_BEFORE_CALL_9| .cse141)))) (= (select (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) .cse140) 0) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|)))) (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| Int)) (and (<= |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| 0) (exists ((|s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse142 (@diff |c_old(#memory_int)| |v_old(#memory_int)_AFTER_CALL_4|))) (and (= |v_old(#memory_int)_AFTER_CALL_4| (store |c_old(#memory_int)| .cse142 (select |v_old(#memory_int)_AFTER_CALL_4| .cse142))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int)))) (let ((.cse148 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_old(#memory_int)_AFTER_CALL_53|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse146 (@diff |v_old(#memory_int)_AFTER_CALL_53| |v_#memory_int_BEFORE_CALL_9|)) (.cse147 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (let ((.cse143 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_old(#memory_int)_AFTER_CALL_4|)) (.cse144 (@diff |v_old(#memory_int)_AFTER_CALL_4| |v_#memory_int_BEFORE_CALL_9|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse143 (select |v_old(#memory_int)_AFTER_CALL_4| .cse143)) |v_old(#memory_int)_AFTER_CALL_4|) (not (= .cse144 .cse143)) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse144 (select |v_#memory_int_BEFORE_CALL_9| .cse144)))))) (= (let ((.cse145 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_9|))) (store |v_old(#memory_int)_BEFORE_CALL_8| .cse145 (select |v_#memory_int_BEFORE_CALL_9| .cse145))) |v_#memory_int_BEFORE_CALL_9|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_53| .cse146 (select |v_#memory_int_BEFORE_CALL_9| .cse146))) (= (select (store |c_old(#valid)| .cse147 1) .cse142) 0) (= (select |c_old(#valid)| .cse147) 0) (not (= .cse146 .cse148)) (= (store |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base| (store (select |v_#memory_int_BEFORE_CALL_9| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5| (select (select |c_#memory_int| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_5|))) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_9| (store |v_old(#memory_int)_AFTER_CALL_4| .cse147 (select |v_#memory_int_BEFORE_CALL_9| .cse147)))))) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse148 (select |v_old(#memory_int)_AFTER_CALL_53| .cse148))))))))) (= (select |c_#valid| |s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base|) 1)))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|) (exists ((|v_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base_BEFORE_CALL_1| Int)) (= (select |c_#valid| |v_s_alloc_state_aws_mem_calloc_~#required_bytes~2#1.base_BEFORE_CALL_1|) 1))) is different from true