./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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1 --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-12-01 13:14:05,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-01 13:14:05,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-12-01 13:14:05,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-01 13:14:05,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-01 13:14:05,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-01 13:14:05,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-01 13:14:05,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-01 13:14:05,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-01 13:14:05,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-01 13:14:05,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-01 13:14:05,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-01 13:14:05,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-01 13:14:05,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-01 13:14:05,494 INFO L153 SettingsManager]: * Use SBE=true [2024-12-01 13:14:05,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-01 13:14:05,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-01 13:14:05,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 13:14:05,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 13:14:05,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-01 13:14:05,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-01 13:14:05,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-01 13:14:05,497 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1 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-12-01 13:14:05,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-01 13:14:05,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-01 13:14:05,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-01 13:14:05,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-01 13:14:05,766 INFO L274 PluginConnector]: CDTParser initialized [2024-12-01 13:14:05,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2024-12-01 13:14:08,373 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/data/4ddb73071/db18597adf4c4223aa5384f663f016ad/FLAG0f99a739e [2024-12-01 13:14:08,807 INFO L384 CDTParser]: Found 1 translation units. [2024-12-01 13:14:08,808 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2024-12-01 13:14:08,838 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/data/4ddb73071/db18597adf4c4223aa5384f663f016ad/FLAG0f99a739e [2024-12-01 13:14:08,941 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/data/4ddb73071/db18597adf4c4223aa5384f663f016ad [2024-12-01 13:14:08,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-01 13:14:08,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-01 13:14:08,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-01 13:14:08,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-01 13:14:08,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-01 13:14:08,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:14:08" (1/1) ... [2024-12-01 13:14:08,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ffdd7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:08, skipping insertion in model container [2024-12-01 13:14:08,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:14:08" (1/1) ... [2024-12-01 13:14:09,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-01 13:14:09,296 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2024-12-01 13:14:09,303 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2024-12-01 13:14:10,338 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,338 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,339 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,339 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,340 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,352 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,353 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,355 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,356 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,357 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,358 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,359 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:10,359 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,340 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,341 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,361 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,362 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,367 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,368 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,380 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,381 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,381 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,381 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,381 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,382 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,382 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,409 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[227916,227929] [2024-12-01 13:14:11,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 13:14:11,436 INFO L200 MainTranslator]: Completed pre-run [2024-12-01 13:14:11,446 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2024-12-01 13:14:11,447 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2024-12-01 13:14:11,481 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,482 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,482 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,482 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,483 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,489 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,489 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,490 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,490 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,491 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,492 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,492 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,492 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2024-12-01 13:14:11,650 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,650 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,655 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,656 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,658 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,658 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,666 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,666 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,667 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,667 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,667 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,667 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,668 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-01 13:14:11,683 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_ce14a7fd-1e81-4c96-8471-e73d24c87c21/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[227916,227929] [2024-12-01 13:14:11,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 13:14:11,864 INFO L204 MainTranslator]: Completed translation [2024-12-01 13:14:11,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11 WrapperNode [2024-12-01 13:14:11,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-01 13:14:11,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-01 13:14:11,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-01 13:14:11,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-01 13:14:11,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:11,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:11,988 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2024-12-01 13:14:11,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-01 13:14:11,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-01 13:14:11,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-01 13:14:11,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-01 13:14:12,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,018 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-12-01 13:14:12,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-01 13:14:12,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-01 13:14:12,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-01 13:14:12,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-01 13:14:12,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (1/1) ... [2024-12-01 13:14:12,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 13:14:12,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 13:14:12,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-01 13:14:12,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2024-12-01 13:14:12,140 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-12-01 13:14:12,140 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-12-01 13:14:12,140 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-12-01 13:14:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-01 13:14:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-12-01 13:14:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-12-01 13:14:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-01 13:14:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2024-12-01 13:14:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2024-12-01 13:14:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-12-01 13:14:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-12-01 13:14:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-12-01 13:14:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-12-01 13:14:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2024-12-01 13:14:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2024-12-01 13:14:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-01 13:14:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2024-12-01 13:14:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2024-12-01 13:14:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-01 13:14:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2024-12-01 13:14:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2024-12-01 13:14:12,422 INFO L234 CfgBuilder]: Building ICFG [2024-12-01 13:14:12,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-01 13:14:13,060 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-01 13:14:18,605 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2024-12-01 13:14:18,606 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2024-12-01 13:14:18,718 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-12-01 13:14:18,718 INFO L283 CfgBuilder]: Performing block encoding [2024-12-01 13:14:18,730 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-01 13:14:18,730 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-01 13:14:18,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:14:18 BoogieIcfgContainer [2024-12-01 13:14:18,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-01 13:14:18,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-01 13:14:18,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-01 13:14:18,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-01 13:14:18,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:14:08" (1/3) ... [2024-12-01 13:14:18,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac29626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:14:18, skipping insertion in model container [2024-12-01 13:14:18,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:14:11" (2/3) ... [2024-12-01 13:14:18,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac29626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:14:18, skipping insertion in model container [2024-12-01 13:14:18,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:14:18" (3/3) ... [2024-12-01 13:14:18,740 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2024-12-01 13:14:18,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-01 13:14:18,755 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-12-01 13:14:18,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 13:14:18,814 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;@32eddfaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 13:14:18,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-01 13:14:18,818 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-12-01 13:14:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-01 13:14:18,826 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:14:18,827 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-12-01 13:14:18,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:14:18,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:14:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1734843285, now seen corresponding path program 1 times [2024-12-01 13:14:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:14:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816725206] [2024-12-01 13:14:18,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:14:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:14:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-12-01 13:14:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:14:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816725206] [2024-12-01 13:14:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816725206] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 13:14:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44756579] [2024-12-01 13:14:25,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 13:14:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 13:14:25,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 13:14:25,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-01 13:14:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:14:30,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-01 13:14:30,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 13:14:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-12-01 13:14:30,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 13:14:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44756579] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:14:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-01 13:14:30,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-01 13:14:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966450762] [2024-12-01 13:14:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:14:30,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 13:14:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:14:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 13:14:30,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 13:14:30,910 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-12-01 13:14:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:14:30,944 INFO L93 Difference]: Finished difference Result 371 states and 495 transitions. [2024-12-01 13:14:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 13:14:30,945 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-12-01 13:14:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:14:30,952 INFO L225 Difference]: With dead ends: 371 [2024-12-01 13:14:30,952 INFO L226 Difference]: Without dead ends: 184 [2024-12-01 13:14:30,955 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-12-01 13:14:30,958 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-12-01 13:14:30,959 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-12-01 13:14:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-12-01 13:14:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-12-01 13:14:30,996 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-12-01 13:14:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2024-12-01 13:14:31,003 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 70 [2024-12-01 13:14:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:14:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2024-12-01 13:14:31,005 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-12-01 13:14:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2024-12-01 13:14:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-01 13:14:31,007 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:14:31,007 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-12-01 13:14:31,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-01 13:14:31,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-01 13:14:31,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:14:31,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:14:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1662150887, now seen corresponding path program 1 times [2024-12-01 13:14:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:14:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853522512] [2024-12-01 13:14:31,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:14:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:14:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:14:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:14:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853522512] [2024-12-01 13:14:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853522512] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:14:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:14:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:14:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924187002] [2024-12-01 13:14:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:14:37,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:14:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:14:37,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:14:37,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:14:37,782 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-12-01 13:14:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:14:37,887 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2024-12-01 13:14:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:14:37,888 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-12-01 13:14:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:14:37,890 INFO L225 Difference]: With dead ends: 316 [2024-12-01 13:14:37,890 INFO L226 Difference]: Without dead ends: 186 [2024-12-01 13:14:37,891 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-12-01 13:14:37,891 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-12-01 13:14:37,891 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-12-01 13:14:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-12-01 13:14:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-12-01 13:14:37,905 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-12-01 13:14:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 235 transitions. [2024-12-01 13:14:37,906 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 235 transitions. Word has length 70 [2024-12-01 13:14:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:14:37,907 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 235 transitions. [2024-12-01 13:14:37,907 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-12-01 13:14:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 235 transitions. [2024-12-01 13:14:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-01 13:14:37,908 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:14:37,908 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-12-01 13:14:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-01 13:14:37,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:14:37,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:14:37,909 INFO L85 PathProgramCache]: Analyzing trace with hash -475052884, now seen corresponding path program 1 times [2024-12-01 13:14:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:14:37,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922024551] [2024-12-01 13:14:37,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:14:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:14:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:14:43,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:14:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922024551] [2024-12-01 13:14:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922024551] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:14:43,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:14:43,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:14:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106418869] [2024-12-01 13:14:43,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:14:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:14:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:14:43,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:14:43,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:14:43,125 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-12-01 13:14:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:14:43,219 INFO L93 Difference]: Finished difference Result 224 states and 278 transitions. [2024-12-01 13:14:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:14:43,220 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-12-01 13:14:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:14:43,223 INFO L225 Difference]: With dead ends: 224 [2024-12-01 13:14:43,223 INFO L226 Difference]: Without dead ends: 190 [2024-12-01 13:14:43,224 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-12-01 13:14:43,225 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-12-01 13:14:43,225 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-12-01 13:14:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-12-01 13:14:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-12-01 13:14:43,242 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-12-01 13:14:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 239 transitions. [2024-12-01 13:14:43,245 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 239 transitions. Word has length 72 [2024-12-01 13:14:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:14:43,246 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 239 transitions. [2024-12-01 13:14:43,246 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-12-01 13:14:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 239 transitions. [2024-12-01 13:14:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-01 13:14:43,248 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:14:43,248 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-12-01 13:14:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-01 13:14:43,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:14:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:14:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1439224058, now seen corresponding path program 1 times [2024-12-01 13:14:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:14:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738593140] [2024-12-01 13:14:43,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:14:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:14:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:14:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:14:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738593140] [2024-12-01 13:14:48,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738593140] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:14:48,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:14:48,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:14:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713664190] [2024-12-01 13:14:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:14:48,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:14:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:14:48,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:14:48,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:14:48,427 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-12-01 13:14:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:14:48,491 INFO L93 Difference]: Finished difference Result 224 states and 277 transitions. [2024-12-01 13:14:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:14:48,492 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-12-01 13:14:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:14:48,494 INFO L225 Difference]: With dead ends: 224 [2024-12-01 13:14:48,494 INFO L226 Difference]: Without dead ends: 190 [2024-12-01 13:14:48,494 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-12-01 13:14:48,495 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-12-01 13:14:48,496 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-12-01 13:14:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-12-01 13:14:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2024-12-01 13:14:48,508 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-12-01 13:14:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2024-12-01 13:14:48,511 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 77 [2024-12-01 13:14:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:14:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2024-12-01 13:14:48,512 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-12-01 13:14:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2024-12-01 13:14:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-01 13:14:48,514 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:14:48,514 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-12-01 13:14:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-01 13:14:48,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:14:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:14:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1011536445, now seen corresponding path program 1 times [2024-12-01 13:14:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:14:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274613344] [2024-12-01 13:14:48,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:14:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:14:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:14:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:14:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274613344] [2024-12-01 13:14:53,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274613344] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:14:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:14:53,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 13:14:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629359671] [2024-12-01 13:14:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:14:53,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 13:14:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:14:53,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 13:14:53,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:14:53,879 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-12-01 13:14:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:14:54,025 INFO L93 Difference]: Finished difference Result 296 states and 363 transitions. [2024-12-01 13:14:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 13:14:54,026 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-12-01 13:14:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:14:54,029 INFO L225 Difference]: With dead ends: 296 [2024-12-01 13:14:54,029 INFO L226 Difference]: Without dead ends: 191 [2024-12-01 13:14:54,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:14:54,031 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 13:14:54,031 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.1s Time] [2024-12-01 13:14:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-12-01 13:14:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-12-01 13:14:54,043 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-12-01 13:14:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 240 transitions. [2024-12-01 13:14:54,044 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 240 transitions. Word has length 94 [2024-12-01 13:14:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:14:54,045 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 240 transitions. [2024-12-01 13:14:54,045 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-12-01 13:14:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 240 transitions. [2024-12-01 13:14:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-01 13:14:54,047 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:14:54,047 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-12-01 13:14:54,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-01 13:14:54,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:14:54,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:14:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1521911148, now seen corresponding path program 1 times [2024-12-01 13:14:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:14:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557247003] [2024-12-01 13:14:54,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:14:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:14:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:15:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:15:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:15:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557247003] [2024-12-01 13:15:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557247003] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:15:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:15:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-01 13:15:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772746969] [2024-12-01 13:15:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:15:01,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-01 13:15:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:15:01,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-01 13:15:01,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:15:01,266 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-12-01 13:15:05,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-01 13:15:09,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-01 13:15:14,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-01 13:15:18,356 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-12-01 13:15:22,688 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-12-01 13:15:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:15:25,628 INFO L93 Difference]: Finished difference Result 235 states and 292 transitions. [2024-12-01 13:15:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-01 13:15:25,632 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-12-01 13:15:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:15:25,634 INFO L225 Difference]: With dead ends: 235 [2024-12-01 13:15:25,634 INFO L226 Difference]: Without dead ends: 199 [2024-12-01 13:15:25,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-12-01 13:15:25,635 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 11 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s 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, 23.9s IncrementalHoareTripleChecker+Time [2024-12-01 13:15:25,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1264 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 5 Unknown, 0 Unchecked, 23.9s Time] [2024-12-01 13:15:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-12-01 13:15:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-12-01 13:15:25,644 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-12-01 13:15:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2024-12-01 13:15:25,646 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 100 [2024-12-01 13:15:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:15:25,646 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2024-12-01 13:15:25,646 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-12-01 13:15:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2024-12-01 13:15:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-01 13:15:25,647 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:15:25,647 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-12-01 13:15:25,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-01 13:15:25,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:15:25,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:15:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1128884138, now seen corresponding path program 1 times [2024-12-01 13:15:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:15:25,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52105700] [2024-12-01 13:15:25,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:15:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:15:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:15:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:15:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:15:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52105700] [2024-12-01 13:15:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52105700] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:15:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:15:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 13:15:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623671489] [2024-12-01 13:15:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:15:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 13:15:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:15:30,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 13:15:30,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:15:30,974 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-12-01 13:15:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:15:31,157 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2024-12-01 13:15:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 13:15:31,157 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-12-01 13:15:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:15:31,160 INFO L225 Difference]: With dead ends: 242 [2024-12-01 13:15:31,160 INFO L226 Difference]: Without dead ends: 201 [2024-12-01 13:15:31,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:15:31,161 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 5 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-12-01 13:15:31,161 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.2s Time] [2024-12-01 13:15:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-01 13:15:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-12-01 13:15:31,171 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-12-01 13:15:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2024-12-01 13:15:31,173 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 100 [2024-12-01 13:15:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:15:31,173 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2024-12-01 13:15:31,174 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-12-01 13:15:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2024-12-01 13:15:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-01 13:15:31,176 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:15:31,176 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-12-01 13:15:31,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-01 13:15:31,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:15:31,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:15:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1119241339, now seen corresponding path program 1 times [2024-12-01 13:15:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:15:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978764106] [2024-12-01 13:15:31,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:15:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:15:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:15:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-01 13:15:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:15:40,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978764106] [2024-12-01 13:15:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978764106] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:15:40,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:15:40,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-01 13:15:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044136558] [2024-12-01 13:15:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:15:40,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-01 13:15:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:15:40,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-01 13:15:40,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-01 13:15:40,301 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-12-01 13:15:44,372 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-12-01 13:15:48,710 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-12-01 13:15:53,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-01 13:15:57,449 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-12-01 13:16:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:01,026 INFO L93 Difference]: Finished difference Result 249 states and 308 transitions. [2024-12-01 13:16:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-01 13:16:01,028 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-12-01 13:16:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:01,029 INFO L225 Difference]: With dead ends: 249 [2024-12-01 13:16:01,029 INFO L226 Difference]: Without dead ends: 201 [2024-12-01 13:16:01,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-01 13:16:01,030 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 7 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s 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, 20.3s IncrementalHoareTripleChecker+Time [2024-12-01 13:16:01,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1714 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 20.3s Time] [2024-12-01 13:16:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-01 13:16:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-12-01 13:16:01,037 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-12-01 13:16:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2024-12-01 13:16:01,038 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 106 [2024-12-01 13:16:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:01,039 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2024-12-01 13:16:01,039 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-12-01 13:16:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2024-12-01 13:16:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-01 13:16:01,040 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:01,040 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-12-01 13:16:01,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-01 13:16:01,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1357800383, now seen corresponding path program 1 times [2024-12-01 13:16:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030847047] [2024-12-01 13:16:01,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-12-01 13:16:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030847047] [2024-12-01 13:16:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030847047] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:06,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:06,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:16:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628362609] [2024-12-01 13:16:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:06,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:16:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:06,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:16:06,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:16:06,260 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-12-01 13:16:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:06,326 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2024-12-01 13:16:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:16:06,327 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-12-01 13:16:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:06,329 INFO L225 Difference]: With dead ends: 313 [2024-12-01 13:16:06,329 INFO L226 Difference]: Without dead ends: 198 [2024-12-01 13:16:06,330 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-12-01 13:16:06,330 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-12-01 13:16:06,331 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-12-01 13:16:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-12-01 13:16:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2024-12-01 13:16:06,340 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-12-01 13:16:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2024-12-01 13:16:06,342 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 141 [2024-12-01 13:16:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:06,343 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2024-12-01 13:16:06,343 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-12-01 13:16:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2024-12-01 13:16:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-01 13:16:06,345 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:06,345 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-12-01 13:16:06,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-01 13:16:06,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:06,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash -200941205, now seen corresponding path program 1 times [2024-12-01 13:16:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842649284] [2024-12-01 13:16:06,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-12-01 13:16:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842649284] [2024-12-01 13:16:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842649284] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 13:16:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993704331] [2024-12-01 13:16:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:12,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 13:16:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:12,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 13:16:12,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:16:12,441 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-12-01 13:16:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:12,651 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2024-12-01 13:16:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 13:16:12,652 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-12-01 13:16:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:12,654 INFO L225 Difference]: With dead ends: 248 [2024-12-01 13:16:12,654 INFO L226 Difference]: Without dead ends: 198 [2024-12-01 13:16:12,654 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-12-01 13:16:12,655 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-12-01 13:16:12,655 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-12-01 13:16:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-12-01 13:16:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-12-01 13:16:12,667 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-12-01 13:16:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 245 transitions. [2024-12-01 13:16:12,669 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 245 transitions. Word has length 147 [2024-12-01 13:16:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:12,669 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 245 transitions. [2024-12-01 13:16:12,669 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-12-01 13:16:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2024-12-01 13:16:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-01 13:16:12,672 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:12,672 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-12-01 13:16:12,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-01 13:16:12,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:12,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1764365140, now seen corresponding path program 1 times [2024-12-01 13:16:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440391306] [2024-12-01 13:16:12,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-12-01 13:16:18,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:18,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440391306] [2024-12-01 13:16:18,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440391306] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:18,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:16:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289213549] [2024-12-01 13:16:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:16:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:18,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:16:18,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:16:18,026 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-12-01 13:16:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:18,302 INFO L93 Difference]: Finished difference Result 248 states and 303 transitions. [2024-12-01 13:16:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:16:18,303 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-12-01 13:16:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:18,304 INFO L225 Difference]: With dead ends: 248 [2024-12-01 13:16:18,304 INFO L226 Difference]: Without dead ends: 198 [2024-12-01 13:16:18,305 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-12-01 13:16:18,305 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-12-01 13:16:18,305 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.3s Time] [2024-12-01 13:16:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-12-01 13:16:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2024-12-01 13:16:18,311 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-12-01 13:16:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2024-12-01 13:16:18,312 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 153 [2024-12-01 13:16:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:18,312 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2024-12-01 13:16:18,312 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-12-01 13:16:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2024-12-01 13:16:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-01 13:16:18,314 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:18,314 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-12-01 13:16:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-01 13:16:18,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 965134937, now seen corresponding path program 1 times [2024-12-01 13:16:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104156841] [2024-12-01 13:16:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-12-01 13:16:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104156841] [2024-12-01 13:16:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104156841] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-01 13:16:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182768808] [2024-12-01 13:16:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:24,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 13:16:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:24,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 13:16:24,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-01 13:16:24,107 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-12-01 13:16:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:24,412 INFO L93 Difference]: Finished difference Result 250 states and 303 transitions. [2024-12-01 13:16:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 13:16:24,412 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-12-01 13:16:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:24,414 INFO L225 Difference]: With dead ends: 250 [2024-12-01 13:16:24,414 INFO L226 Difference]: Without dead ends: 199 [2024-12-01 13:16:24,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-01 13:16:24,415 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-12-01 13:16:24,415 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-12-01 13:16:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-12-01 13:16:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-12-01 13:16:24,420 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-12-01 13:16:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 242 transitions. [2024-12-01 13:16:24,422 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 242 transitions. Word has length 160 [2024-12-01 13:16:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:24,422 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 242 transitions. [2024-12-01 13:16:24,422 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-12-01 13:16:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 242 transitions. [2024-12-01 13:16:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-01 13:16:24,423 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:24,424 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-12-01 13:16:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-01 13:16:24,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2097784857, now seen corresponding path program 1 times [2024-12-01 13:16:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142774380] [2024-12-01 13:16:24,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-12-01 13:16:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142774380] [2024-12-01 13:16:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142774380] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-01 13:16:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556322317] [2024-12-01 13:16:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-01 13:16:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-01 13:16:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:16:31,310 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-12-01 13:16:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:31,883 INFO L93 Difference]: Finished difference Result 249 states and 301 transitions. [2024-12-01 13:16:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-01 13:16:31,887 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-12-01 13:16:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:31,889 INFO L225 Difference]: With dead ends: 249 [2024-12-01 13:16:31,889 INFO L226 Difference]: Without dead ends: 191 [2024-12-01 13:16:31,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:16:31,889 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.6s IncrementalHoareTripleChecker+Time [2024-12-01 13:16:31,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1538 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-01 13:16:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-12-01 13:16:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-12-01 13:16:31,895 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-12-01 13:16:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-12-01 13:16:31,896 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 166 [2024-12-01 13:16:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:31,897 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-12-01 13:16:31,897 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-12-01 13:16:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-12-01 13:16:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-01 13:16:31,898 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:31,898 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-12-01 13:16:31,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-01 13:16:31,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:31,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1128868307, now seen corresponding path program 1 times [2024-12-01 13:16:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:31,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444566559] [2024-12-01 13:16:31,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:16:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444566559] [2024-12-01 13:16:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444566559] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-01 13:16:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432452977] [2024-12-01 13:16:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-01 13:16:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:38,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-01 13:16:38,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-01 13:16:38,797 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-12-01 13:16:42,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-01 13:16:47,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-01 13:16:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:48,943 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2024-12-01 13:16:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-01 13:16:48,944 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-12-01 13:16:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:48,945 INFO L225 Difference]: With dead ends: 237 [2024-12-01 13:16:48,945 INFO L226 Difference]: Without dead ends: 192 [2024-12-01 13:16:48,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-01 13:16:48,946 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 13:16:48,946 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.1s Time] [2024-12-01 13:16:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-12-01 13:16:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2024-12-01 13:16:48,951 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-12-01 13:16:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2024-12-01 13:16:48,953 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 185 [2024-12-01 13:16:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:48,953 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2024-12-01 13:16:48,953 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-12-01 13:16:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2024-12-01 13:16:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-01 13:16:48,955 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:48,955 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-12-01 13:16:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-01 13:16:48,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:48,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash -821047252, now seen corresponding path program 1 times [2024-12-01 13:16:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496603648] [2024-12-01 13:16:48,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:16:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:16:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:16:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:16:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496603648] [2024-12-01 13:16:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496603648] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:16:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:16:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:16:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17159929] [2024-12-01 13:16:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:16:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:16:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:16:54,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:16:54,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:16:54,350 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-12-01 13:16:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:16:54,993 INFO L93 Difference]: Finished difference Result 337 states and 397 transitions. [2024-12-01 13:16:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:16:54,994 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-12-01 13:16:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:16:54,996 INFO L225 Difference]: With dead ends: 337 [2024-12-01 13:16:54,996 INFO L226 Difference]: Without dead ends: 194 [2024-12-01 13:16:54,997 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-12-01 13:16:54,997 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2024-12-01 13:16:54,998 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.6s Time] [2024-12-01 13:16:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-12-01 13:16:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-12-01 13:16:55,006 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-12-01 13:16:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2024-12-01 13:16:55,008 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 192 [2024-12-01 13:16:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:16:55,008 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2024-12-01 13:16:55,008 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-12-01 13:16:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2024-12-01 13:16:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-01 13:16:55,010 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:16:55,010 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-12-01 13:16:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-01 13:16:55,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:16:55,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:16:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1075932206, now seen corresponding path program 1 times [2024-12-01 13:16:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:16:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696338219] [2024-12-01 13:16:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:16:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696338219] [2024-12-01 13:17:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696338219] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:17:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534723387] [2024-12-01 13:17:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:02,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:17:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:02,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:17:02,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:17:02,658 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-12-01 13:17:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:03,376 INFO L93 Difference]: Finished difference Result 333 states and 389 transitions. [2024-12-01 13:17:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:17:03,377 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-12-01 13:17:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:03,379 INFO L225 Difference]: With dead ends: 333 [2024-12-01 13:17:03,379 INFO L226 Difference]: Without dead ends: 194 [2024-12-01 13:17:03,380 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-12-01 13:17:03,380 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2024-12-01 13:17:03,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 594 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-01 13:17:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-12-01 13:17:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-12-01 13:17:03,389 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-12-01 13:17:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2024-12-01 13:17:03,391 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 192 [2024-12-01 13:17:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:03,391 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2024-12-01 13:17:03,392 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-12-01 13:17:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2024-12-01 13:17:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-01 13:17:03,393 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:03,393 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-12-01 13:17:03,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-01 13:17:03,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash 109488580, now seen corresponding path program 1 times [2024-12-01 13:17:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:03,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246478643] [2024-12-01 13:17:03,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246478643] [2024-12-01 13:17:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246478643] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:17:08,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833980728] [2024-12-01 13:17:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:08,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:17:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:08,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:17:08,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:17:08,402 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-12-01 13:17:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:08,503 INFO L93 Difference]: Finished difference Result 329 states and 383 transitions. [2024-12-01 13:17:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:17:08,504 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-12-01 13:17:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:08,505 INFO L225 Difference]: With dead ends: 329 [2024-12-01 13:17:08,505 INFO L226 Difference]: Without dead ends: 194 [2024-12-01 13:17:08,506 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-12-01 13:17:08,506 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-12-01 13:17:08,507 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-12-01 13:17:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-12-01 13:17:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-12-01 13:17:08,512 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-12-01 13:17:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2024-12-01 13:17:08,513 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 197 [2024-12-01 13:17:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2024-12-01 13:17:08,514 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-12-01 13:17:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2024-12-01 13:17:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-01 13:17:08,515 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:08,515 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-12-01 13:17:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-01 13:17:08,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:08,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 495167305, now seen corresponding path program 1 times [2024-12-01 13:17:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711185454] [2024-12-01 13:17:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:14,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:14,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711185454] [2024-12-01 13:17:14,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711185454] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:14,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:14,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-01 13:17:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414293751] [2024-12-01 13:17:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:14,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 13:17:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:14,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 13:17:14,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-01 13:17:14,467 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-12-01 13:17:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:14,639 INFO L93 Difference]: Finished difference Result 331 states and 385 transitions. [2024-12-01 13:17:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 13:17:14,640 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-12-01 13:17:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:14,641 INFO L225 Difference]: With dead ends: 331 [2024-12-01 13:17:14,641 INFO L226 Difference]: Without dead ends: 190 [2024-12-01 13:17:14,642 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-12-01 13:17:14,642 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-12-01 13:17:14,642 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-12-01 13:17:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-12-01 13:17:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-12-01 13:17:14,647 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-12-01 13:17:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2024-12-01 13:17:14,648 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 199 [2024-12-01 13:17:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:14,649 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2024-12-01 13:17:14,649 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-12-01 13:17:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2024-12-01 13:17:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-01 13:17:14,650 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:14,650 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-12-01 13:17:14,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-01 13:17:14,651 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -9410609, now seen corresponding path program 1 times [2024-12-01 13:17:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379705080] [2024-12-01 13:17:14,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379705080] [2024-12-01 13:17:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379705080] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 13:17:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745474845] [2024-12-01 13:17:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:22,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 13:17:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:22,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 13:17:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:17:22,997 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-12-01 13:17:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:24,150 INFO L93 Difference]: Finished difference Result 353 states and 417 transitions. [2024-12-01 13:17:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 13:17:24,151 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-12-01 13:17:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:24,153 INFO L225 Difference]: With dead ends: 353 [2024-12-01 13:17:24,153 INFO L226 Difference]: Without dead ends: 193 [2024-12-01 13:17:24,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:17:24,154 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 13:17:24,154 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.1s Time] [2024-12-01 13:17:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-12-01 13:17:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-12-01 13:17:24,161 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-12-01 13:17:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2024-12-01 13:17:24,162 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 205 [2024-12-01 13:17:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:24,162 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2024-12-01 13:17:24,162 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-12-01 13:17:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2024-12-01 13:17:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-01 13:17:24,163 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:24,163 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-12-01 13:17:24,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-01 13:17:24,163 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:24,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2090327821, now seen corresponding path program 1 times [2024-12-01 13:17:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034485497] [2024-12-01 13:17:24,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034485497] [2024-12-01 13:17:33,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034485497] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:33,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:33,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 13:17:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425876455] [2024-12-01 13:17:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:33,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 13:17:33,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:33,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 13:17:33,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:17:33,248 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-12-01 13:17:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:34,501 INFO L93 Difference]: Finished difference Result 351 states and 413 transitions. [2024-12-01 13:17:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 13:17:34,502 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-12-01 13:17:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:34,503 INFO L225 Difference]: With dead ends: 351 [2024-12-01 13:17:34,503 INFO L226 Difference]: Without dead ends: 191 [2024-12-01 13:17:34,503 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-12-01 13:17:34,504 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2024-12-01 13:17:34,504 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.2s Time] [2024-12-01 13:17:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-12-01 13:17:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-12-01 13:17:34,512 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-12-01 13:17:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2024-12-01 13:17:34,513 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 205 [2024-12-01 13:17:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:34,513 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2024-12-01 13:17:34,514 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-12-01 13:17:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2024-12-01 13:17:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-01 13:17:34,514 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:34,515 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-12-01 13:17:34,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-01 13:17:34,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:34,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -380151606, now seen corresponding path program 1 times [2024-12-01 13:17:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:34,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820396347] [2024-12-01 13:17:34,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820396347] [2024-12-01 13:17:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820396347] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-01 13:17:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848726089] [2024-12-01 13:17:44,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-01 13:17:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:44,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-01 13:17:44,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-01 13:17:44,438 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-12-01 13:17:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:45,360 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2024-12-01 13:17:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 13:17:45,361 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-12-01 13:17:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:45,362 INFO L225 Difference]: With dead ends: 356 [2024-12-01 13:17:45,362 INFO L226 Difference]: Without dead ends: 195 [2024-12-01 13:17:45,363 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-12-01 13:17:45,364 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-12-01 13:17:45,364 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-12-01 13:17:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-01 13:17:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-12-01 13:17:45,369 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-12-01 13:17:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2024-12-01 13:17:45,370 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 206 [2024-12-01 13:17:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2024-12-01 13:17:45,370 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-12-01 13:17:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2024-12-01 13:17:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-01 13:17:45,371 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:45,372 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-12-01 13:17:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-01 13:17:45,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 287230284, now seen corresponding path program 1 times [2024-12-01 13:17:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:45,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122225857] [2024-12-01 13:17:45,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:17:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:17:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:17:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:17:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122225857] [2024-12-01 13:17:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122225857] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:17:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:17:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 13:17:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107630285] [2024-12-01 13:17:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:17:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 13:17:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:17:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 13:17:54,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:17:54,700 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-12-01 13:17:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:17:55,508 INFO L93 Difference]: Finished difference Result 351 states and 410 transitions. [2024-12-01 13:17:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 13:17:55,509 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-12-01 13:17:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:17:55,511 INFO L225 Difference]: With dead ends: 351 [2024-12-01 13:17:55,511 INFO L226 Difference]: Without dead ends: 195 [2024-12-01 13:17:55,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 13:17:55,514 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-12-01 13:17:55,514 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-12-01 13:17:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-01 13:17:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-12-01 13:17:55,521 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-12-01 13:17:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 229 transitions. [2024-12-01 13:17:55,522 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 229 transitions. Word has length 206 [2024-12-01 13:17:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:17:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 229 transitions. [2024-12-01 13:17:55,523 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-12-01 13:17:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 229 transitions. [2024-12-01 13:17:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-01 13:17:55,524 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:17:55,524 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-12-01 13:17:55,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-01 13:17:55,524 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:17:55,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:17:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1819033432, now seen corresponding path program 1 times [2024-12-01 13:17:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:17:55,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456736571] [2024-12-01 13:17:55,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:17:55,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:18:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:18:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:18:04,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:18:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456736571] [2024-12-01 13:18:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456736571] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:18:04,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:18:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-01 13:18:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093042350] [2024-12-01 13:18:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:18:04,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-01 13:18:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:18:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-01 13:18:04,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:18:04,303 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-12-01 13:18:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:18:05,458 INFO L93 Difference]: Finished difference Result 351 states and 409 transitions. [2024-12-01 13:18:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-01 13:18:05,458 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-12-01 13:18:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:18:05,460 INFO L225 Difference]: With dead ends: 351 [2024-12-01 13:18:05,460 INFO L226 Difference]: Without dead ends: 198 [2024-12-01 13:18:05,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:18:05,461 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 13:18:05,461 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.1s Time] [2024-12-01 13:18:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-12-01 13:18:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-12-01 13:18:05,467 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-12-01 13:18:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 232 transitions. [2024-12-01 13:18:05,469 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 232 transitions. Word has length 207 [2024-12-01 13:18:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:18:05,469 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 232 transitions. [2024-12-01 13:18:05,469 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-12-01 13:18:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 232 transitions. [2024-12-01 13:18:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-01 13:18:05,470 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:18:05,471 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-12-01 13:18:05,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-01 13:18:05,471 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:18:05,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:18:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1689935974, now seen corresponding path program 1 times [2024-12-01 13:18:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:18:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580964991] [2024-12-01 13:18:05,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:18:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:18:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:18:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:18:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:18:14,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580964991] [2024-12-01 13:18:14,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580964991] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:18:14,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:18:14,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 13:18:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016934134] [2024-12-01 13:18:14,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:18:14,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 13:18:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:18:14,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 13:18:14,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 13:18:14,316 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-12-01 13:18:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:18:15,430 INFO L93 Difference]: Finished difference Result 350 states and 406 transitions. [2024-12-01 13:18:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 13:18:15,431 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-12-01 13:18:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:18:15,432 INFO L225 Difference]: With dead ends: 350 [2024-12-01 13:18:15,432 INFO L226 Difference]: Without dead ends: 198 [2024-12-01 13:18:15,433 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-12-01 13:18:15,433 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 13:18:15,434 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.1s Time] [2024-12-01 13:18:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-12-01 13:18:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-12-01 13:18:15,439 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-12-01 13:18:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2024-12-01 13:18:15,440 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 207 [2024-12-01 13:18:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:18:15,440 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2024-12-01 13:18:15,440 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-12-01 13:18:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2024-12-01 13:18:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-01 13:18:15,442 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:18:15,443 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-12-01 13:18:15,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-01 13:18:15,443 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:18:15,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:18:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1827379267, now seen corresponding path program 1 times [2024-12-01 13:18:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:18:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933679711] [2024-12-01 13:18:15,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:18:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:18:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:18:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:18:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:18:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933679711] [2024-12-01 13:18:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933679711] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:18:25,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:18:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-01 13:18:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275701617] [2024-12-01 13:18:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:18:25,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-01 13:18:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:18:25,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-01 13:18:25,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-01 13:18:25,781 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-12-01 13:18:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:18:27,231 INFO L93 Difference]: Finished difference Result 350 states and 405 transitions. [2024-12-01 13:18:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-01 13:18:27,232 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-12-01 13:18:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:18:27,233 INFO L225 Difference]: With dead ends: 350 [2024-12-01 13:18:27,233 INFO L226 Difference]: Without dead ends: 201 [2024-12-01 13:18:27,234 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-12-01 13:18:27,234 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 2 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-01 13:18:27,234 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.4s Time] [2024-12-01 13:18:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-01 13:18:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-12-01 13:18:27,240 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-12-01 13:18:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2024-12-01 13:18:27,242 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 208 [2024-12-01 13:18:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:18:27,242 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2024-12-01 13:18:27,242 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-12-01 13:18:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2024-12-01 13:18:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-01 13:18:27,244 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:18:27,244 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-12-01 13:18:27,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-01 13:18:27,244 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:18:27,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:18:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1063718843, now seen corresponding path program 1 times [2024-12-01 13:18:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:18:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295602261] [2024-12-01 13:18:27,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:18:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:18:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:18:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:18:37,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:18:37,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295602261] [2024-12-01 13:18:37,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295602261] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:18:37,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:18:37,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-01 13:18:37,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760414598] [2024-12-01 13:18:37,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:18:37,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 13:18:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:18:37,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 13:18:37,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-01 13:18:37,119 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-12-01 13:18:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:18:38,513 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2024-12-01 13:18:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 13:18:38,514 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-12-01 13:18:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:18:38,515 INFO L225 Difference]: With dead ends: 349 [2024-12-01 13:18:38,515 INFO L226 Difference]: Without dead ends: 201 [2024-12-01 13:18:38,515 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-12-01 13:18:38,516 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 7 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-01 13:18:38,516 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.4s Time] [2024-12-01 13:18:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-01 13:18:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-12-01 13:18:38,523 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-12-01 13:18:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2024-12-01 13:18:38,524 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 208 [2024-12-01 13:18:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:18:38,525 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2024-12-01 13:18:38,525 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-12-01 13:18:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2024-12-01 13:18:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-01 13:18:38,526 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:18:38,527 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-12-01 13:18:38,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-01 13:18:38,527 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:18:38,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:18:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1893044737, now seen corresponding path program 1 times [2024-12-01 13:18:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:18:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823808151] [2024-12-01 13:18:38,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:18:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:18:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:18:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:18:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:18:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823808151] [2024-12-01 13:18:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823808151] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:18:48,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:18:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-01 13:18:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488141824] [2024-12-01 13:18:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:18:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-01 13:18:48,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:18:48,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-01 13:18:48,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-12-01 13:18:48,940 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-12-01 13:18:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:18:52,725 INFO L93 Difference]: Finished difference Result 351 states and 404 transitions. [2024-12-01 13:18:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-01 13:18:52,726 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-12-01 13:18:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:18:52,727 INFO L225 Difference]: With dead ends: 351 [2024-12-01 13:18:52,727 INFO L226 Difference]: Without dead ends: 206 [2024-12-01 13:18:52,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-12-01 13:18:52,728 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 7 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 3.8s IncrementalHoareTripleChecker+Time [2024-12-01 13:18:52,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1600 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-12-01 13:18:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-12-01 13:18:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-12-01 13:18:52,733 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-12-01 13:18:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2024-12-01 13:18:52,734 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 209 [2024-12-01 13:18:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:18:52,734 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2024-12-01 13:18:52,734 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-12-01 13:18:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2024-12-01 13:18:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-01 13:18:52,735 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:18:52,735 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-12-01 13:18:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-01 13:18:52,735 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:18:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:18:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1831650753, now seen corresponding path program 1 times [2024-12-01 13:18:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:18:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644412524] [2024-12-01 13:18:52,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:18:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:18:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:19:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-12-01 13:19:03,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:19:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644412524] [2024-12-01 13:19:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644412524] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 13:19:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 13:19:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-01 13:19:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430438387] [2024-12-01 13:19:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 13:19:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-01 13:19:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 13:19:03,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-01 13:19:03,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:19:03,511 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-12-01 13:19:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 13:19:05,801 INFO L93 Difference]: Finished difference Result 350 states and 400 transitions. [2024-12-01 13:19:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-01 13:19:05,801 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-12-01 13:19:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 13:19:05,803 INFO L225 Difference]: With dead ends: 350 [2024-12-01 13:19:05,803 INFO L226 Difference]: Without dead ends: 206 [2024-12-01 13:19:05,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-01 13:19:05,803 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 8 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.3s IncrementalHoareTripleChecker+Time [2024-12-01 13:19:05,804 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.3s Time] [2024-12-01 13:19:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-12-01 13:19:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-12-01 13:19:05,808 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-12-01 13:19:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 234 transitions. [2024-12-01 13:19:05,809 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 234 transitions. Word has length 209 [2024-12-01 13:19:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 13:19:05,809 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 234 transitions. [2024-12-01 13:19:05,809 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-12-01 13:19:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 234 transitions. [2024-12-01 13:19:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-01 13:19:05,810 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 13:19:05,810 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-12-01 13:19:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-01 13:19:05,811 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-01 13:19:05,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 13:19:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash 894245850, now seen corresponding path program 1 times [2024-12-01 13:19:05,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 13:19:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581562440] [2024-12-01 13:19:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:19:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 13:19:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:20:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-12-01 13:20:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 13:20:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581562440] [2024-12-01 13:20:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581562440] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 13:20:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413813284] [2024-12-01 13:20:17,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 13:20:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 13:20:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 13:20:17,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 13:20:17,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce14a7fd-1e81-4c96-8471-e73d24c87c21/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-01 13:20:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 13:20:25,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 228 conjuncts are in the unsatisfiable core [2024-12-01 13:20:25,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 13:20:26,054 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-12-01 13:20:27,467 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-12-01 13:20:44,306 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-12-01 13:20:46,342 INFO L349 Elim1Store]: treesize reduction 61, result has 21.8 percent of original size [2024-12-01 13:20:46,342 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-12-01 13:20:48,532 INFO L349 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2024-12-01 13:20:48,532 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-12-01 13:20:50,690 INFO L349 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2024-12-01 13:20:50,690 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-12-01 13:20:53,704 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-01 13:20:53,705 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-12-01 13:20:55,911 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-12-01 13:20:55,941 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-12-01 13:21:02,625 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-12-01 13:21:02,648 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-12-01 13:21:04,018 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-12-01 13:21:04,043 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-12-01 13:21:05,081 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-12-01 13:21:05,081 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-12-01 13:21:05,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 13:21:05,558 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-12-01 13:21:06,481 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-12-01 13:21:06,481 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-12-01 13:21:06,608 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-12-01 13:21:06,630 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-12-01 13:21:08,209 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-12-01 13:21:08,238 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-12-01 13:21:08,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 13:21:08,719 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-12-01 13:21:09,849 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-12-01 13:21:09,850 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-12-01 13:21:09,962 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-12-01 13:21:09,963 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-12-01 13:21:12,200 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-12-01 13:21:12,227 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-12-01 13:21:17,496 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-12-01 13:21:17,551 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-12-01 13:21:18,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 13:21:18,896 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-12-01 13:21:19,773 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-12-01 13:21:19,773 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-12-01 13:21:19,870 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-12-01 13:21:19,871 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-12-01 13:21:23,955 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-12-01 13:21:23,994 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-12-01 13:21:29,691 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-12-01 13:21:29,749 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-12-01 13:21:30,044 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-12-01 13:21:34,746 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-12-01 13:21:34,789 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-12-01 13:21:40,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 13:21:40,804 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-12-01 13:23:09,872 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-12-01 13:23:10,078 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