./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_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_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:42:11,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:42:11,932 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-28 02:42:11,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:42:11,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:42:11,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:42:11,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:42:11,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:42:11,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:42:11,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:42:11,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:42:11,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:42:11,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:42:11,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:42:11,986 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:42:11,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:42:11,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:42:11,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:42:11,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:42:11,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:42:11,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:42:11,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:42:11,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:42:11,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:42:11,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:42:11,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:42:11,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:42:11,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:42:11,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:42:11,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:42:11,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:42:11,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:42:11,991 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_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 [2024-11-28 02:42:12,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:42:12,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:42:12,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:42:12,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:42:12,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:42:12,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i [2024-11-28 02:42:15,406 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/data/943f7edae/5a347022dee142dc8633fccd4edbe52d/FLAG10beb1617 [2024-11-28 02:42:16,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:42:16,264 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i [2024-11-28 02:42:16,318 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/data/943f7edae/5a347022dee142dc8633fccd4edbe52d/FLAG10beb1617 [2024-11-28 02:42:16,336 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/data/943f7edae/5a347022dee142dc8633fccd4edbe52d [2024-11-28 02:42:16,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:42:16,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:42:16,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:42:16,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:42:16,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:42:16,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:42:16" (1/1) ... [2024-11-28 02:42:16,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c17a8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:16, skipping insertion in model container [2024-11-28 02:42:16,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:42:16" (1/1) ... [2024-11-28 02:42:16,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:42:16,907 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_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i[4501,4514] [2024-11-28 02:42:16,919 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_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i[4561,4574] [2024-11-28 02:42:18,342 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,343 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,344 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,345 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,346 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,382 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,383 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,386 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,388 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,390 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,392 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,393 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:18,393 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,890 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,892 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,933 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,934 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,942 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,945 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,974 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,977 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,978 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,978 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,978 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,979 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:19,980 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,033 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_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i[227778,227791] [2024-11-28 02:42:20,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:42:20,078 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:42:20,102 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_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i[4501,4514] [2024-11-28 02:42:20,103 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_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i[4561,4574] [2024-11-28 02:42:20,218 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,219 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,219 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,220 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,220 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,230 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,230 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,232 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,232 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,233 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,234 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,235 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,235 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2024-11-28 02:42:20,462 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,462 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,531 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,532 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,538 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,539 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,551 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,552 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,553 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,554 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,555 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,555 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,557 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 02:42:20,589 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_b6c8b695-1622-4e34-b27d-33e9cd597127/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i[227778,227791] [2024-11-28 02:42:20,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:42:21,035 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:42:21,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21 WrapperNode [2024-11-28 02:42:21,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:42:21,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:42:21,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:42:21,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:42:21,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,317 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2024-11-28 02:42:21,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:42:21,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:42:21,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:42:21,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:42:21,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,377 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 02:42:21,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:42:21,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:42:21,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:42:21,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:42:21,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (1/1) ... [2024-11-28 02:42:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:42:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:21,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:42:21,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:42:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2024-11-28 02:42:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2024-11-28 02:42:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-28 02:42:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:42:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-28 02:42:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-28 02:42:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-11-28 02:42:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-11-28 02:42:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 02:42:21,584 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2024-11-28 02:42:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2024-11-28 02:42:21,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 02:42:21,584 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-11-28 02:42:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-11-28 02:42:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:42:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:42:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-28 02:42:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2024-11-28 02:42:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2024-11-28 02:42:21,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:42:21,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:42:21,587 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2024-11-28 02:42:21,587 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2024-11-28 02:42:21,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 02:42:21,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:42:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:42:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-11-28 02:42:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-11-28 02:42:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-11-28 02:42:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-11-28 02:42:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-28 02:42:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:42:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2024-11-28 02:42:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2024-11-28 02:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 02:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2024-11-28 02:42:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2024-11-28 02:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-28 02:42:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-28 02:42:21,591 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-28 02:42:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-11-28 02:42:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-11-28 02:42:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2024-11-28 02:42:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2024-11-28 02:42:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-28 02:42:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-28 02:42:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 02:42:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2024-11-28 02:42:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2024-11-28 02:42:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 02:42:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2024-11-28 02:42:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2024-11-28 02:42:22,121 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:42:22,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:42:23,301 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:42:29,419 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2024-11-28 02:42:29,420 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2024-11-28 02:42:29,551 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-28 02:42:29,551 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:42:29,577 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:42:29,577 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 02:42:29,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:29 BoogieIcfgContainer [2024-11-28 02:42:29,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:42:29,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:42:29,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:42:29,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:42:29,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:42:16" (1/3) ... [2024-11-28 02:42:29,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b23e2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:42:29, skipping insertion in model container [2024-11-28 02:42:29,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:42:21" (2/3) ... [2024-11-28 02:42:29,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b23e2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:42:29, skipping insertion in model container [2024-11-28 02:42:29,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:42:29" (3/3) ... [2024-11-28 02:42:29,596 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness.i [2024-11-28 02:42:29,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:42:29,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness.i that has 20 procedures, 205 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:42:29,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:42:29,691 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;@80d5522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:42:29,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:42:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 146 states have internal predecessors, (185), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-28 02:42:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 02:42:29,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:29,707 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:42:29,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:42:29,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1301518678, now seen corresponding path program 1 times [2024-11-28 02:42:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:29,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342741417] [2024-11-28 02:42:29,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-28 02:42:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342741417] [2024-11-28 02:42:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342741417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980225976] [2024-11-28 02:42:37,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:37,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:42:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:37,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:42:38,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:42:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:45,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:42:45,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:42:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-28 02:42:45,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:42:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980225976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:42:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 02:42:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736648117] [2024-11-28 02:42:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:42:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:45,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:42:45,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:42:45,618 INFO L87 Difference]: Start difference. First operand has 205 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 146 states have internal predecessors, (185), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 02:42:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:45,661 INFO L93 Difference]: Finished difference Result 399 states and 534 transitions. [2024-11-28 02:42:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:42:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-28 02:42:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:45,672 INFO L225 Difference]: With dead ends: 399 [2024-11-28 02:42:45,672 INFO L226 Difference]: Without dead ends: 196 [2024-11-28 02:42:45,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:42:45,679 INFO L435 NwaCegarLoop]: 258 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, 258 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:45,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:42:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-28 02:42:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-28 02:42:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 138 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:42:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2024-11-28 02:42:45,731 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 76 [2024-11-28 02:42:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:45,732 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2024-11-28 02:42:45,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 02:42:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2024-11-28 02:42:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 02:42:45,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:45,736 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:42:45,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:42:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 02:42:45,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:42:45,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1082817808, now seen corresponding path program 1 times [2024-11-28 02:42:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:45,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878386583] [2024-11-28 02:42:45,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 02:42:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878386583] [2024-11-28 02:42:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878386583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:42:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170077946] [2024-11-28 02:42:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:42:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:42:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:42:52,738 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 02:42:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:52,922 INFO L93 Difference]: Finished difference Result 338 states and 417 transitions. [2024-11-28 02:42:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:42:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-28 02:42:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:52,929 INFO L225 Difference]: With dead ends: 338 [2024-11-28 02:42:52,929 INFO L226 Difference]: Without dead ends: 198 [2024-11-28 02:42:52,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:42:52,932 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:52,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 733 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:42:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-28 02:42:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-28 02:42:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 140 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:42:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2024-11-28 02:42:52,974 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 76 [2024-11-28 02:42:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2024-11-28 02:42:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 02:42:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2024-11-28 02:42:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:42:52,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:52,977 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:42:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:42:52,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:42:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1899895979, now seen corresponding path program 1 times [2024-11-28 02:42:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825855145] [2024-11-28 02:42:52,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 02:43:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825855145] [2024-11-28 02:43:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825855145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:43:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182798966] [2024-11-28 02:43:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:43:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:00,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:43:00,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:00,718 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 02:43:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:00,836 INFO L93 Difference]: Finished difference Result 250 states and 308 transitions. [2024-11-28 02:43:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:43:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2024-11-28 02:43:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:00,840 INFO L225 Difference]: With dead ends: 250 [2024-11-28 02:43:00,840 INFO L226 Difference]: Without dead ends: 202 [2024-11-28 02:43:00,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:00,842 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:00,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 733 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:43:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-28 02:43:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-28 02:43:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 143 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:43:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2024-11-28 02:43:00,862 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 78 [2024-11-28 02:43:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:00,862 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2024-11-28 02:43:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 02:43:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2024-11-28 02:43:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-28 02:43:00,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:00,866 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:43:00,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1151022943, now seen corresponding path program 1 times [2024-11-28 02:43:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839499959] [2024-11-28 02:43:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 02:43:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839499959] [2024-11-28 02:43:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839499959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:07,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:43:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278751348] [2024-11-28 02:43:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:07,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:43:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:07,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:43:07,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:07,446 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-28 02:43:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:07,558 INFO L93 Difference]: Finished difference Result 250 states and 307 transitions. [2024-11-28 02:43:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:43:07,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-11-28 02:43:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:07,562 INFO L225 Difference]: With dead ends: 250 [2024-11-28 02:43:07,562 INFO L226 Difference]: Without dead ends: 202 [2024-11-28 02:43:07,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:07,568 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:07,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 735 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:43:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-28 02:43:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2024-11-28 02:43:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 140 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:43:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2024-11-28 02:43:07,600 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 83 [2024-11-28 02:43:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:07,601 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2024-11-28 02:43:07,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-28 02:43:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2024-11-28 02:43:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:43:07,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:07,605 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:43:07,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:07,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1327299412, now seen corresponding path program 1 times [2024-11-28 02:43:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84287255] [2024-11-28 02:43:07,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 02:43:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84287255] [2024-11-28 02:43:14,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84287255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:14,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:14,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:43:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772839409] [2024-11-28 02:43:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:14,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:43:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:14,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:43:14,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:43:14,453 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:43:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:14,629 INFO L93 Difference]: Finished difference Result 318 states and 390 transitions. [2024-11-28 02:43:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:43:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-28 02:43:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:14,634 INFO L225 Difference]: With dead ends: 318 [2024-11-28 02:43:14,634 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 02:43:14,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:43:14,636 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:14,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:43:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 02:43:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-28 02:43:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 144 states have internal predecessors, (175), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2024-11-28 02:43:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 255 transitions. [2024-11-28 02:43:14,653 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 255 transitions. Word has length 100 [2024-11-28 02:43:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 255 transitions. [2024-11-28 02:43:14,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:43:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 255 transitions. [2024-11-28 02:43:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:43:14,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:14,656 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:43:14,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:43:14,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:14,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 721441017, now seen corresponding path program 1 times [2024-11-28 02:43:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558111630] [2024-11-28 02:43:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 02:43:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558111630] [2024-11-28 02:43:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558111630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:43:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924135664] [2024-11-28 02:43:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:43:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:23,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:43:23,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:43:23,600 INFO L87 Difference]: Start difference. First operand 203 states and 255 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-28 02:43:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:23,958 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2024-11-28 02:43:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:43:23,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-28 02:43:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:23,960 INFO L225 Difference]: With dead ends: 258 [2024-11-28 02:43:23,961 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 02:43:23,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:43:23,962 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:23,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 972 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:43:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 02:43:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-28 02:43:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.2097902097902098) internal successors, (173), 144 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2024-11-28 02:43:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2024-11-28 02:43:23,975 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 106 [2024-11-28 02:43:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:23,976 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2024-11-28 02:43:23,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-28 02:43:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2024-11-28 02:43:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-28 02:43:23,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:23,978 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-11-28 02:43:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:43:23,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash -173700675, now seen corresponding path program 1 times [2024-11-28 02:43:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764563014] [2024-11-28 02:43:23,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-28 02:43:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764563014] [2024-11-28 02:43:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764563014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:29,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:29,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:43:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918532537] [2024-11-28 02:43:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:29,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:43:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:29,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:43:29,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:29,956 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-28 02:43:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:30,033 INFO L93 Difference]: Finished difference Result 321 states and 389 transitions. [2024-11-28 02:43:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:43:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2024-11-28 02:43:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:30,036 INFO L225 Difference]: With dead ends: 321 [2024-11-28 02:43:30,038 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 02:43:30,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:30,041 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 731 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:30,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 731 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:43:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 02:43:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2024-11-28 02:43:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2014388489208634) internal successors, (167), 140 states have internal predecessors, (167), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:43:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2024-11-28 02:43:30,063 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 141 [2024-11-28 02:43:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:30,065 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2024-11-28 02:43:30,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-28 02:43:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2024-11-28 02:43:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-28 02:43:30,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:30,070 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-11-28 02:43:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:43:30,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash -668690355, now seen corresponding path program 1 times [2024-11-28 02:43:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665081560] [2024-11-28 02:43:30,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-28 02:43:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665081560] [2024-11-28 02:43:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665081560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:43:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286470388] [2024-11-28 02:43:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:36,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:43:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:36,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:43:36,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:43:36,201 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-28 02:43:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:36,373 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2024-11-28 02:43:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:43:36,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2024-11-28 02:43:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:36,377 INFO L225 Difference]: With dead ends: 260 [2024-11-28 02:43:36,379 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 02:43:36,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:43:36,380 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 950 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:36,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 950 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:43:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 02:43:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-28 02:43:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1958041958041958) internal successors, (171), 144 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2024-11-28 02:43:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2024-11-28 02:43:36,398 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 147 [2024-11-28 02:43:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:36,400 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2024-11-28 02:43:36,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-28 02:43:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2024-11-28 02:43:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-28 02:43:36,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:36,404 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-11-28 02:43:36,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:43:36,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:36,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1368070874, now seen corresponding path program 1 times [2024-11-28 02:43:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868221168] [2024-11-28 02:43:36,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-28 02:43:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:42,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868221168] [2024-11-28 02:43:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868221168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:43:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914560150] [2024-11-28 02:43:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:42,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:43:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:42,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:43:42,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:42,218 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-28 02:43:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:42,574 INFO L93 Difference]: Finished difference Result 260 states and 315 transitions. [2024-11-28 02:43:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:43:42,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2024-11-28 02:43:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:42,581 INFO L225 Difference]: With dead ends: 260 [2024-11-28 02:43:42,581 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 02:43:42,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:43:42,584 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 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-11-28 02:43:42,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:43:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 02:43:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2024-11-28 02:43:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 140 states have internal predecessors, (166), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 02:43:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2024-11-28 02:43:42,606 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 153 [2024-11-28 02:43:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:42,607 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2024-11-28 02:43:42,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-28 02:43:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2024-11-28 02:43:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:43:42,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:42,609 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-11-28 02:43:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:43:42,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:42,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -636381911, now seen corresponding path program 1 times [2024-11-28 02:43:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428380900] [2024-11-28 02:43:42,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-28 02:43:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428380900] [2024-11-28 02:43:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428380900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:48,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:43:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139687610] [2024-11-28 02:43:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:48,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:43:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:48,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:43:48,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:43:48,995 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:43:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:49,245 INFO L93 Difference]: Finished difference Result 262 states and 315 transitions. [2024-11-28 02:43:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:43:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-11-28 02:43:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:49,248 INFO L225 Difference]: With dead ends: 262 [2024-11-28 02:43:49,248 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 02:43:49,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:43:49,250 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1176 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:49,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1176 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:43:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 02:43:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2024-11-28 02:43:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 144 states have internal predecessors, (170), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:43:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 248 transitions. [2024-11-28 02:43:49,262 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 248 transitions. Word has length 160 [2024-11-28 02:43:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:49,263 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 248 transitions. [2024-11-28 02:43:49,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 02:43:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 248 transitions. [2024-11-28 02:43:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-28 02:43:49,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:49,266 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-11-28 02:43:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:43:49,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:49,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -4930485, now seen corresponding path program 1 times [2024-11-28 02:43:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26822128] [2024-11-28 02:43:49,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-28 02:43:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:56,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26822128] [2024-11-28 02:43:56,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26822128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:43:56,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:43:56,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:43:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126365539] [2024-11-28 02:43:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:43:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:43:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:56,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:43:56,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:43:56,150 INFO L87 Difference]: Start difference. First operand 203 states and 248 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-28 02:43:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:56,579 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2024-11-28 02:43:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:43:56,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2024-11-28 02:43:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:56,588 INFO L225 Difference]: With dead ends: 261 [2024-11-28 02:43:56,588 INFO L226 Difference]: Without dead ends: 196 [2024-11-28 02:43:56,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:43:56,589 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1643 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:56,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1643 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:43:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-28 02:43:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-28 02:43:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 138 states have (on average 1.181159420289855) internal successors, (163), 139 states have internal predecessors, (163), 38 states have call successors, (38), 19 states have call predecessors, (38), 19 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-28 02:43:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 238 transitions. [2024-11-28 02:43:56,601 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 238 transitions. Word has length 166 [2024-11-28 02:43:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:56,602 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 238 transitions. [2024-11-28 02:43:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-28 02:43:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 238 transitions. [2024-11-28 02:43:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-28 02:43:56,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:56,605 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:43:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:43:56,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:43:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash -816007831, now seen corresponding path program 1 times [2024-11-28 02:43:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880006737] [2024-11-28 02:43:56,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:44:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:44:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:44:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880006737] [2024-11-28 02:44:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880006737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:44:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530345897] [2024-11-28 02:44:08,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:44:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:44:08,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:44:08,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:44:08,150 INFO L87 Difference]: Start difference. First operand 196 states and 238 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-28 02:44:12,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:44:16,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:44:20,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:44:25,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:44:30,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:44:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:34,158 INFO L93 Difference]: Finished difference Result 254 states and 305 transitions. [2024-11-28 02:44:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:44:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) Word has length 185 [2024-11-28 02:44:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:34,162 INFO L225 Difference]: With dead ends: 254 [2024-11-28 02:44:34,162 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 02:44:34,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:44:34,164 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 11 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:34,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3243 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 4 Unknown, 0 Unchecked, 25.1s Time] [2024-11-28 02:44:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 02:44:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-11-28 02:44:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.1830985915492958) internal successors, (168), 144 states have internal predecessors, (168), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:44:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 244 transitions. [2024-11-28 02:44:34,176 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 244 transitions. Word has length 185 [2024-11-28 02:44:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:34,177 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 244 transitions. [2024-11-28 02:44:34,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-28 02:44:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 244 transitions. [2024-11-28 02:44:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-28 02:44:34,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:34,185 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:44:34,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:44:34,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:44:34,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1209034841, now seen corresponding path program 1 times [2024-11-28 02:44:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:44:34,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831620563] [2024-11-28 02:44:34,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:44:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:44:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:44:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831620563] [2024-11-28 02:44:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831620563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:42,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:42,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:44:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379164203] [2024-11-28 02:44:42,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:44:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:44:42,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:44:42,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:44:42,403 INFO L87 Difference]: Start difference. First operand 201 states and 244 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-28 02:44:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:44:42,719 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2024-11-28 02:44:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:44:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 185 [2024-11-28 02:44:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:44:42,722 INFO L225 Difference]: With dead ends: 261 [2024-11-28 02:44:42,722 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 02:44:42,723 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-11-28 02:44:42,724 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 3 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:44:42,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 927 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:44:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 02:44:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-11-28 02:44:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 145 states have internal predecessors, (169), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:44:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 247 transitions. [2024-11-28 02:44:42,737 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 247 transitions. Word has length 185 [2024-11-28 02:44:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:44:42,738 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 247 transitions. [2024-11-28 02:44:42,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-28 02:44:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 247 transitions. [2024-11-28 02:44:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-28 02:44:42,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:44:42,742 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:44:42,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:44:42,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:44:42,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:44:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 485383974, now seen corresponding path program 1 times [2024-11-28 02:44:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:44:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57677496] [2024-11-28 02:44:42,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:44:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:44:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:44:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:44:49,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:44:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57677496] [2024-11-28 02:44:49,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57677496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:44:49,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:44:49,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:44:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009978052] [2024-11-28 02:44:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:44:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:44:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:44:49,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:44:49,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:44:49,934 INFO L87 Difference]: Start difference. First operand 203 states and 247 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-28 02:44:53,991 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-11-28 02:44:58,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:45:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:00,513 INFO L93 Difference]: Finished difference Result 263 states and 319 transitions. [2024-11-28 02:45:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:45:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2024-11-28 02:45:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:00,516 INFO L225 Difference]: With dead ends: 263 [2024-11-28 02:45:00,516 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 02:45:00,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:45:00,517 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 3 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:00,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1337 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2024-11-28 02:45:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 02:45:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2024-11-28 02:45:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1748251748251748) internal successors, (168), 145 states have internal predecessors, (168), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:45:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 246 transitions. [2024-11-28 02:45:00,535 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 246 transitions. Word has length 191 [2024-11-28 02:45:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:00,536 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 246 transitions. [2024-11-28 02:45:00,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-28 02:45:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 246 transitions. [2024-11-28 02:45:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 02:45:00,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:00,543 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:45:00,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:45:00,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1184539933, now seen corresponding path program 1 times [2024-11-28 02:45:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109738609] [2024-11-28 02:45:00,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:45:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109738609] [2024-11-28 02:45:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109738609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:07,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:45:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612009712] [2024-11-28 02:45:07,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:45:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:07,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:45:07,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:45:07,260 INFO L87 Difference]: Start difference. First operand 203 states and 246 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:08,054 INFO L93 Difference]: Finished difference Result 359 states and 424 transitions. [2024-11-28 02:45:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:45:08,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2024-11-28 02:45:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:08,061 INFO L225 Difference]: With dead ends: 359 [2024-11-28 02:45:08,061 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 02:45:08,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:45:08,062 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 655 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:08,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 655 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:45:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 02:45:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-28 02:45:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 146 states have (on average 1.1712328767123288) internal successors, (171), 148 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:45:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 249 transitions. [2024-11-28 02:45:08,093 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 249 transitions. Word has length 198 [2024-11-28 02:45:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 249 transitions. [2024-11-28 02:45:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 249 transitions. [2024-11-28 02:45:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 02:45:08,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:08,096 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:45:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:45:08,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:08,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash 712439525, now seen corresponding path program 1 times [2024-11-28 02:45:08,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831492244] [2024-11-28 02:45:08,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:45:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831492244] [2024-11-28 02:45:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831492244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:45:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405359986] [2024-11-28 02:45:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:17,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:45:17,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:17,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:45:17,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:45:17,606 INFO L87 Difference]: Start difference. First operand 206 states and 249 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:18,503 INFO L93 Difference]: Finished difference Result 355 states and 416 transitions. [2024-11-28 02:45:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:45:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2024-11-28 02:45:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:18,509 INFO L225 Difference]: With dead ends: 355 [2024-11-28 02:45:18,509 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 02:45:18,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:45:18,514 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 639 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.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:18,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 639 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:45:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 02:45:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-28 02:45:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 146 states have (on average 1.1643835616438356) internal successors, (170), 148 states have internal predecessors, (170), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:45:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2024-11-28 02:45:18,531 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 198 [2024-11-28 02:45:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:18,531 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2024-11-28 02:45:18,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2024-11-28 02:45:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-28 02:45:18,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:18,535 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:45:18,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:45:18,535 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:18,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash -385921493, now seen corresponding path program 1 times [2024-11-28 02:45:18,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:18,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332099694] [2024-11-28 02:45:18,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:45:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332099694] [2024-11-28 02:45:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332099694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:24,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:45:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897618171] [2024-11-28 02:45:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:24,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:45:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:24,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:45:24,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:45:24,339 INFO L87 Difference]: Start difference. First operand 206 states and 248 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-28 02:45:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:24,475 INFO L93 Difference]: Finished difference Result 351 states and 410 transitions. [2024-11-28 02:45:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:45:24,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 203 [2024-11-28 02:45:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:24,479 INFO L225 Difference]: With dead ends: 351 [2024-11-28 02:45:24,479 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 02:45:24,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:45:24,481 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:24,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:45:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 02:45:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-11-28 02:45:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.1597222222222223) internal successors, (167), 146 states have internal predecessors, (167), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-28 02:45:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 245 transitions. [2024-11-28 02:45:24,494 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 245 transitions. Word has length 203 [2024-11-28 02:45:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 245 transitions. [2024-11-28 02:45:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-28 02:45:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 245 transitions. [2024-11-28 02:45:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-28 02:45:24,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:24,496 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:45:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:45:24,497 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1083635152, now seen corresponding path program 1 times [2024-11-28 02:45:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328953724] [2024-11-28 02:45:24,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:45:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328953724] [2024-11-28 02:45:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328953724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:45:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811256066] [2024-11-28 02:45:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:45:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:30,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:45:30,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:45:30,371 INFO L87 Difference]: Start difference. First operand 204 states and 245 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-28 02:45:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:30,528 INFO L93 Difference]: Finished difference Result 353 states and 412 transitions. [2024-11-28 02:45:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:45:30,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 205 [2024-11-28 02:45:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:30,530 INFO L225 Difference]: With dead ends: 353 [2024-11-28 02:45:30,530 INFO L226 Difference]: Without dead ends: 202 [2024-11-28 02:45:30,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:45:30,532 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1148 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:30,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:45:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-28 02:45:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2024-11-28 02:45:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 142 states have internal predecessors, (162), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:45:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2024-11-28 02:45:30,542 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 205 [2024-11-28 02:45:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:30,543 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2024-11-28 02:45:30,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-28 02:45:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2024-11-28 02:45:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-28 02:45:30,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:30,545 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:30,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:45:30,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash 561452762, now seen corresponding path program 1 times [2024-11-28 02:45:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133083630] [2024-11-28 02:45:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:45:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133083630] [2024-11-28 02:45:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133083630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:41,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:45:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232763538] [2024-11-28 02:45:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:41,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:45:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:41,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:45:41,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:45:41,175 INFO L87 Difference]: Start difference. First operand 199 states and 238 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:42,341 INFO L93 Difference]: Finished difference Result 375 states and 444 transitions. [2024-11-28 02:45:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:45:42,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 211 [2024-11-28 02:45:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:42,349 INFO L225 Difference]: With dead ends: 375 [2024-11-28 02:45:42,349 INFO L226 Difference]: Without dead ends: 205 [2024-11-28 02:45:42,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:45:42,350 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 2 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 821 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-11-28 02:45:42,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 821 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:45:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-28 02:45:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2024-11-28 02:45:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.1527777777777777) internal successors, (166), 146 states have internal predecessors, (166), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:45:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 242 transitions. [2024-11-28 02:45:42,364 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 242 transitions. Word has length 211 [2024-11-28 02:45:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:42,364 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 242 transitions. [2024-11-28 02:45:42,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 242 transitions. [2024-11-28 02:45:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-28 02:45:42,366 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:42,367 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:42,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:45:42,367 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:42,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1633776104, now seen corresponding path program 1 times [2024-11-28 02:45:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513525589] [2024-11-28 02:45:42,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:45:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513525589] [2024-11-28 02:45:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513525589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:54,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:54,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:45:54,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039862304] [2024-11-28 02:45:54,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:54,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:45:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:54,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:45:54,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:45:54,773 INFO L87 Difference]: Start difference. First operand 203 states and 242 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:56,103 INFO L93 Difference]: Finished difference Result 373 states and 440 transitions. [2024-11-28 02:45:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:45:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 211 [2024-11-28 02:45:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:56,106 INFO L225 Difference]: With dead ends: 373 [2024-11-28 02:45:56,106 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 02:45:56,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:45:56,110 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 1 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 789 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:56,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 789 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:45:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 02:45:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2024-11-28 02:45:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.15) internal successors, (161), 142 states have internal predecessors, (161), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:45:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2024-11-28 02:45:56,127 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 211 [2024-11-28 02:45:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:56,128 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2024-11-28 02:45:56,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:45:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2024-11-28 02:45:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-28 02:45:56,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:56,130 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:45:56,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:45:56,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:45:56,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2080288001, now seen corresponding path program 1 times [2024-11-28 02:45:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401571651] [2024-11-28 02:45:56,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:46:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401571651] [2024-11-28 02:46:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401571651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:06,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:06,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:46:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138176103] [2024-11-28 02:46:06,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:06,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:46:06,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:06,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:46:06,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:46:06,210 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:07,546 INFO L93 Difference]: Finished difference Result 378 states and 447 transitions. [2024-11-28 02:46:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:46:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 212 [2024-11-28 02:46:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:07,549 INFO L225 Difference]: With dead ends: 378 [2024-11-28 02:46:07,549 INFO L226 Difference]: Without dead ends: 207 [2024-11-28 02:46:07,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:46:07,551 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 2 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:07,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1035 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:46:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-28 02:46:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-28 02:46:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.1418918918918919) internal successors, (169), 150 states have internal predecessors, (169), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:46:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 245 transitions. [2024-11-28 02:46:07,562 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 245 transitions. Word has length 212 [2024-11-28 02:46:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:07,562 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 245 transitions. [2024-11-28 02:46:07,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 245 transitions. [2024-11-28 02:46:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-28 02:46:07,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:07,564 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:46:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 02:46:07,564 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:46:07,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1547297405, now seen corresponding path program 1 times [2024-11-28 02:46:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051578263] [2024-11-28 02:46:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:46:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051578263] [2024-11-28 02:46:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051578263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:46:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794166545] [2024-11-28 02:46:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:17,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:46:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:17,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:46:17,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:46:17,319 INFO L87 Difference]: Start difference. First operand 207 states and 245 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:18,357 INFO L93 Difference]: Finished difference Result 373 states and 437 transitions. [2024-11-28 02:46:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:46:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 212 [2024-11-28 02:46:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:18,360 INFO L225 Difference]: With dead ends: 373 [2024-11-28 02:46:18,360 INFO L226 Difference]: Without dead ends: 207 [2024-11-28 02:46:18,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:46:18,363 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:18,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 600 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:46:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-28 02:46:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-28 02:46:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.135135135135135) internal successors, (168), 150 states have internal predecessors, (168), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:46:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 244 transitions. [2024-11-28 02:46:18,375 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 244 transitions. Word has length 212 [2024-11-28 02:46:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:18,376 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 244 transitions. [2024-11-28 02:46:18,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 244 transitions. [2024-11-28 02:46:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-28 02:46:18,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:18,378 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:46:18,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:46:18,378 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:46:18,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:18,379 INFO L85 PathProgramCache]: Analyzing trace with hash -911272653, now seen corresponding path program 1 times [2024-11-28 02:46:18,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512553502] [2024-11-28 02:46:18,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:46:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512553502] [2024-11-28 02:46:30,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512553502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:30,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:30,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:46:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59285200] [2024-11-28 02:46:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:30,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:46:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:30,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:46:30,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:46:30,892 INFO L87 Difference]: Start difference. First operand 207 states and 244 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:32,432 INFO L93 Difference]: Finished difference Result 373 states and 436 transitions. [2024-11-28 02:46:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:46:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 213 [2024-11-28 02:46:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:32,437 INFO L225 Difference]: With dead ends: 373 [2024-11-28 02:46:32,437 INFO L226 Difference]: Without dead ends: 210 [2024-11-28 02:46:32,438 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-11-28 02:46:32,439 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 2 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:32,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1237 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 02:46:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-28 02:46:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-28 02:46:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 151 states have (on average 1.1324503311258278) internal successors, (171), 153 states have internal predecessors, (171), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:46:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2024-11-28 02:46:32,450 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 213 [2024-11-28 02:46:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:32,451 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2024-11-28 02:46:32,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2024-11-28 02:46:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-28 02:46:32,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:32,453 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2024-11-28 02:46:32,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:46:32,454 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:46:32,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1697270543, now seen corresponding path program 1 times [2024-11-28 02:46:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131279718] [2024-11-28 02:46:32,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:46:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131279718] [2024-11-28 02:46:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131279718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:46:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817247759] [2024-11-28 02:46:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:42,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:46:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:42,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:46:42,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:46:42,141 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:43,199 INFO L93 Difference]: Finished difference Result 372 states and 433 transitions. [2024-11-28 02:46:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:46:43,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 213 [2024-11-28 02:46:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:43,202 INFO L225 Difference]: With dead ends: 372 [2024-11-28 02:46:43,202 INFO L226 Difference]: Without dead ends: 210 [2024-11-28 02:46:43,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:46:43,204 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 795 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:43,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 795 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:46:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-28 02:46:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-28 02:46:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 151 states have (on average 1.1258278145695364) internal successors, (170), 153 states have internal predecessors, (170), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:46:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2024-11-28 02:46:43,214 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 213 [2024-11-28 02:46:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:43,215 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2024-11-28 02:46:43,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2024-11-28 02:46:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-28 02:46:43,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:43,217 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:46:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 02:46:43,217 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:46:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1846736634, now seen corresponding path program 1 times [2024-11-28 02:46:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351780087] [2024-11-28 02:46:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:46:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351780087] [2024-11-28 02:46:52,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351780087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:52,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:52,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:46:52,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125543605] [2024-11-28 02:46:52,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:46:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:52,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:46:52,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:46:52,921 INFO L87 Difference]: Start difference. First operand 210 states and 246 transitions. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:54,368 INFO L93 Difference]: Finished difference Result 372 states and 432 transitions. [2024-11-28 02:46:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:46:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 214 [2024-11-28 02:46:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:54,370 INFO L225 Difference]: With dead ends: 372 [2024-11-28 02:46:54,370 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 02:46:54,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:46:54,371 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 2 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1241 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-11-28 02:46:54,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1241 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:46:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 02:46:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-28 02:46:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 154 states have (on average 1.1233766233766234) internal successors, (173), 156 states have internal predecessors, (173), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:46:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2024-11-28 02:46:54,382 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 214 [2024-11-28 02:46:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:54,382 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2024-11-28 02:46:54,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:46:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2024-11-28 02:46:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-28 02:46:54,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:54,384 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:46:54,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 02:46:54,385 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:46:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1044361476, now seen corresponding path program 1 times [2024-11-28 02:46:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946811284] [2024-11-28 02:46:54,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:47:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946811284] [2024-11-28 02:47:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946811284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311400396] [2024-11-28 02:47:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:05,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:47:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:05,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:47:05,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:47:05,593 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:47:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:06,955 INFO L93 Difference]: Finished difference Result 371 states and 429 transitions. [2024-11-28 02:47:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:47:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 214 [2024-11-28 02:47:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:06,958 INFO L225 Difference]: With dead ends: 371 [2024-11-28 02:47:06,959 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 02:47:06,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:47:06,960 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 984 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:06,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 984 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:47:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 02:47:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-28 02:47:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 154 states have (on average 1.1168831168831168) internal successors, (172), 156 states have internal predecessors, (172), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:47:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 248 transitions. [2024-11-28 02:47:06,971 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 248 transitions. Word has length 214 [2024-11-28 02:47:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:06,971 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 248 transitions. [2024-11-28 02:47:06,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:47:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 248 transitions. [2024-11-28 02:47:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-28 02:47:06,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:06,974 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1] [2024-11-28 02:47:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:47:06,974 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:47:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 141700108, now seen corresponding path program 1 times [2024-11-28 02:47:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955108083] [2024-11-28 02:47:06,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:47:17,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955108083] [2024-11-28 02:47:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955108083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:17,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:47:17,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850692106] [2024-11-28 02:47:17,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:17,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:47:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:17,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:47:17,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:47:17,029 INFO L87 Difference]: Start difference. First operand 213 states and 248 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:47:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:20,713 INFO L93 Difference]: Finished difference Result 373 states and 431 transitions. [2024-11-28 02:47:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:47:20,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2024-11-28 02:47:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:20,716 INFO L225 Difference]: With dead ends: 373 [2024-11-28 02:47:20,716 INFO L226 Difference]: Without dead ends: 218 [2024-11-28 02:47:20,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:47:20,718 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 7 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:20,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1925 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-28 02:47:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-28 02:47:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-28 02:47:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.1132075471698113) internal successors, (177), 161 states have internal predecessors, (177), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:47:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 253 transitions. [2024-11-28 02:47:20,728 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 253 transitions. Word has length 215 [2024-11-28 02:47:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:20,729 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 253 transitions. [2024-11-28 02:47:20,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:47:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 253 transitions. [2024-11-28 02:47:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-28 02:47:20,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:20,730 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1] [2024-11-28 02:47:20,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:47:20,731 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:47:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash 711971914, now seen corresponding path program 1 times [2024-11-28 02:47:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197450620] [2024-11-28 02:47:20,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-28 02:47:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197450620] [2024-11-28 02:47:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197450620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:32,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:47:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846894983] [2024-11-28 02:47:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:32,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:47:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:32,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:47:32,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:32,755 INFO L87 Difference]: Start difference. First operand 218 states and 253 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:47:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:34,860 INFO L93 Difference]: Finished difference Result 372 states and 427 transitions. [2024-11-28 02:47:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:47:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2024-11-28 02:47:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:34,863 INFO L225 Difference]: With dead ends: 372 [2024-11-28 02:47:34,863 INFO L226 Difference]: Without dead ends: 218 [2024-11-28 02:47:34,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:34,865 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 8 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1344 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:34,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1344 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:47:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-28 02:47:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-28 02:47:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 157 states have (on average 1.1019108280254777) internal successors, (173), 159 states have internal predecessors, (173), 38 states have call successors, (38), 19 states have call predecessors, (38), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2024-11-28 02:47:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 249 transitions. [2024-11-28 02:47:34,874 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 249 transitions. Word has length 215 [2024-11-28 02:47:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:34,874 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 249 transitions. [2024-11-28 02:47:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-28 02:47:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 249 transitions. [2024-11-28 02:47:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-28 02:47:34,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:34,876 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1, 1, 1] [2024-11-28 02:47:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 02:47:34,876 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:47:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash -751854747, now seen corresponding path program 1 times [2024-11-28 02:47:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140644688] [2024-11-28 02:47:34,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-28 02:48:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140644688] [2024-11-28 02:48:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140644688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266360396] [2024-11-28 02:48:49,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:49,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:49,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:49,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:49,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6c8b695-1622-4e34-b27d-33e9cd597127/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:48:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:57,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 5112 conjuncts, 220 conjuncts are in the unsatisfiable core [2024-11-28 02:48:57,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:58,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:48:59,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 02:49:13,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:49:15,687 INFO L349 Elim1Store]: treesize reduction 61, result has 21.8 percent of original size [2024-11-28 02:49:15,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2024-11-28 02:49:17,530 INFO L349 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2024-11-28 02:49:17,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2024-11-28 02:49:19,532 INFO L349 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2024-11-28 02:49:19,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 78 [2024-11-28 02:49:22,492 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:49:22,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 02:49:24,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:49:24,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2024-11-28 02:49:24,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 02:49:27,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-11-28 02:49:29,723 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| (store |c_#valid| |c_hash_table_state_required_bytes_~#elemsize~0.base| 0)) (let ((.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse2 (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|))) (or (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|)) (.cse0 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|))) (and (= (store |c_old(#memory_int)| .cse0 (select |v_#memory_int_BEFORE_CALL_6| .cse0)) |v_#memory_int_BEFORE_CALL_6|) (= .cse1 |c_hash_table_state_required_bytes_#in~required_bytes.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse1 (select |c_#memory_int| .cse1))) (= |c_hash_table_state_required_bytes_~#elemsize~0.base| .cse0)))) (and .cse2 (= |c_hash_table_state_required_bytes_~#elemsize~0.base| .cse3)) (and (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse3 |c_hash_table_state_required_bytes_#in~required_bytes.base|)) .cse2))))) is different from false [2024-11-28 02:49:29,742 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| (store |c_#valid| |c_hash_table_state_required_bytes_~#elemsize~0.base| 0)) (let ((.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse2 (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|))) (or (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|)) (.cse0 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|))) (and (= (store |c_old(#memory_int)| .cse0 (select |v_#memory_int_BEFORE_CALL_6| .cse0)) |v_#memory_int_BEFORE_CALL_6|) (= .cse1 |c_hash_table_state_required_bytes_#in~required_bytes.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse1 (select |c_#memory_int| .cse1))) (= |c_hash_table_state_required_bytes_~#elemsize~0.base| .cse0)))) (and .cse2 (= |c_hash_table_state_required_bytes_~#elemsize~0.base| .cse3)) (and (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse3 |c_hash_table_state_required_bytes_#in~required_bytes.base|)) .cse2))))) is different from true [2024-11-28 02:49:30,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 15 treesize of output 14 [2024-11-28 02:49:30,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse1 (= (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))) (or (and (= |c_old(#valid)| (store |c_#valid| .cse0 0)) .cse1) (and (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse0 |c_hash_table_state_required_bytes_#in~required_bytes.base|)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= |c_old(#valid)| (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) .cse1) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|)) (.cse2 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|))) (and (= (store |c_old(#memory_int)| .cse2 (select |v_#memory_int_BEFORE_CALL_6| .cse2)) |v_#memory_int_BEFORE_CALL_6|) (= .cse3 |c_hash_table_state_required_bytes_#in~required_bytes.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3))) (= |c_old(#valid)| (store |c_#valid| .cse2 0)))))))) is different from false [2024-11-28 02:49:30,426 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse1 (= (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))) (or (and (= |c_old(#valid)| (store |c_#valid| .cse0 0)) .cse1) (and (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse0 |c_hash_table_state_required_bytes_#in~required_bytes.base|)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= |c_old(#valid)| (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) .cse1) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|)) (.cse2 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|))) (and (= (store |c_old(#memory_int)| .cse2 (select |v_#memory_int_BEFORE_CALL_6| .cse2)) |v_#memory_int_BEFORE_CALL_6|) (= .cse3 |c_hash_table_state_required_bytes_#in~required_bytes.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3))) (= |c_old(#valid)| (store |c_#valid| .cse2 0)))))))) is different from true [2024-11-28 02:49:31,075 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse1 (= (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse0 0)))) .cse1) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse0 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse0) 0))) .cse1) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse3 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse2 (select |v_#memory_int_BEFORE_CALL_6| .cse2)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse3) 0) (= (store |c_old(#valid)| .cse3 1) (store |c_#valid| .cse2 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3))))))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-28 02:49:31,109 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse1 (= (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse0 0)))) .cse1) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse0 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse0) 0))) .cse1) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse3 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse2 (select |v_#memory_int_BEFORE_CALL_6| .cse2)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse3) 0) (= (store |c_old(#valid)| .cse3 1) (store |c_#valid| .cse2 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3))))))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-28 02:49:32,480 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2024-11-28 02:49:32,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 88 [2024-11-28 02:49:33,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:49:33,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-28 02:49:33,531 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:49:33,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 28 treesize of output 7 [2024-11-28 02:49:34,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-28 02:49:34,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2024-11-28 02:49:34,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))))) is different from false [2024-11-28 02:49:34,854 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))))) is different from true [2024-11-28 02:49:42,246 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))))) (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse8 (= (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse7 0)))) .cse8) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse7 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse7) 0))) .cse8) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse10 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse9 (select |v_#memory_int_BEFORE_CALL_6| .cse9)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse10) 0) (= (store |c_old(#valid)| .cse10 1) (store |c_#valid| .cse9 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse10 (select |c_#memory_int| .cse10))))))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from false [2024-11-28 02:49:42,275 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6)))))))) (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse8 (= (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse7 0)))) .cse8) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse7 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse7) 0))) .cse8) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse10 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse9 (select |v_#memory_int_BEFORE_CALL_6| .cse9)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse10) 0) (= (store |c_old(#valid)| .cse10 1) (store |c_#valid| .cse9 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse10 (select |c_#memory_int| .cse10))))))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|)) is different from true [2024-11-28 02:49:42,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-28 02:49:43,340 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2024-11-28 02:49:43,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 88 [2024-11-28 02:49:44,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-28 02:49:44,909 INFO L349 Elim1Store]: treesize reduction 20, result has 23.1 percent of original size [2024-11-28 02:49:44,910 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 3 case distinctions, treesize of input 32 treesize of output 23 [2024-11-28 02:49:45,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2024-11-28 02:49:49,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (select (store |c_#valid| .cse7 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse9 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |v_#memory_int_BEFORE_CALL_6| .cse8)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse8 0) .cse9) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse9 (select |c_#memory_int| .cse9)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse10 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse10 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse10 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse11) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|))))))) is different from false [2024-11-28 02:49:49,124 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (select (store |c_#valid| .cse7 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse9 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |v_#memory_int_BEFORE_CALL_6| .cse8)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse8 0) .cse9) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse9 (select |c_#memory_int| .cse9)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse10 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse10 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse10 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse11) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|))))))) is different from true [2024-11-28 02:49:56,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse8 (= (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse7 0)))) .cse8) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse7 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse7) 0))) .cse8) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse10 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse9 (select |v_#memory_int_BEFORE_CALL_6| .cse9)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse10) 0) (= (store |c_old(#valid)| .cse10 1) (store |c_#valid| .cse9 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse10 (select |c_#memory_int| .cse10))))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|) (= (select (store |c_#valid| .cse11 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse13 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |v_#memory_int_BEFORE_CALL_6| .cse12)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse12 0) .cse13) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse13 (select |c_#memory_int| .cse13)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse14 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse14 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse14 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse15) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse15 (select |c_#memory_int| .cse15)) |c_#memory_int|))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|))) is different from false [2024-11-28 02:49:56,694 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse8 (= (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse7 0)))) .cse8) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse7 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse7) 0))) .cse8) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse10 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse9 (select |v_#memory_int_BEFORE_CALL_6| .cse9)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse10) 0) (= (store |c_old(#valid)| .cse10 1) (store |c_#valid| .cse9 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse10 (select |c_#memory_int| .cse10))))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|) (= (select (store |c_#valid| .cse11 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse13 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |v_#memory_int_BEFORE_CALL_6| .cse12)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse12 0) .cse13) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse13 (select |c_#memory_int| .cse13)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse14 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse14 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse14 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse15) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse15 (select |c_#memory_int| .cse15)) |c_#memory_int|))))) (= |c_s_alloc_state_#in~template#1.base| |c_s_alloc_state_~template#1.base|) (= |c_s_alloc_state_~template#1.offset| |c_s_alloc_state_#in~template#1.offset|))) is different from true [2024-11-28 02:49:59,273 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2024-11-28 02:49:59,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 88 [2024-11-28 02:50:00,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-28 02:50:00,877 INFO L349 Elim1Store]: treesize reduction 20, result has 23.1 percent of original size [2024-11-28 02:50:00,877 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 3 case distinctions, treesize of input 32 treesize of output 23 [2024-11-28 02:50:00,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2024-11-28 02:50:01,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-28 02:50:05,163 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (select (store |c_#valid| .cse7 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse9 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |v_#memory_int_BEFORE_CALL_6| .cse8)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse8 0) .cse9) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse9 (select |c_#memory_int| .cse9)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse10 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse10 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse10 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse11) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|))))) (or (exists ((v_prenex_28 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse12 (store |c_#valid| v_prenex_28 0))) (and (= (select .cse12 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse12 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse13 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse13 (select |c_#memory_int| .cse13)) |c_#memory_int|) (= (select (store |c_#valid| .cse13 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((v_prenex_28 Int)) (= (select (store |c_#valid| v_prenex_28 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_6|)) (.cse15 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse14 (select |v_#memory_int_BEFORE_CALL_6| .cse14))) (= (select (store |c_#valid| .cse14 0) .cse15) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse15 (select |c_#memory_int| .cse15)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (let ((.cse16 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse16 (select |c_#memory_int| .cse16)) |c_#memory_int|) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse16) 1))))))) is different from false [2024-11-28 02:50:05,219 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse7 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= (select (store |c_#valid| .cse7 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse9 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse8 (select |v_#memory_int_BEFORE_CALL_6| .cse8)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse8 0) .cse9) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse9 (select |c_#memory_int| .cse9)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse10 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse10 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse10 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse11) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|))))) (or (exists ((v_prenex_28 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse12 (store |c_#valid| v_prenex_28 0))) (and (= (select .cse12 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse12 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse13 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse13 (select |c_#memory_int| .cse13)) |c_#memory_int|) (= (select (store |c_#valid| .cse13 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((v_prenex_28 Int)) (= (select (store |c_#valid| v_prenex_28 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_6|)) (.cse15 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse14 (select |v_#memory_int_BEFORE_CALL_6| .cse14))) (= (select (store |c_#valid| .cse14 0) .cse15) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse15 (select |c_#memory_int| .cse15)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (let ((.cse16 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse16 (select |c_#memory_int| .cse16)) |c_#memory_int|) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse16) 1))))))) is different from true [2024-11-28 02:50:14,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse8 (= (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse7 0)))) .cse8) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse7 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse7) 0))) .cse8) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse10 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse9 (select |v_#memory_int_BEFORE_CALL_6| .cse9)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse10) 0) (= (store |c_old(#valid)| .cse10 1) (store |c_#valid| .cse9 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse10 (select |c_#memory_int| .cse10))))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|) (= (select (store |c_#valid| .cse11 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse13 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |v_#memory_int_BEFORE_CALL_6| .cse12)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse12 0) .cse13) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse13 (select |c_#memory_int| .cse13)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse14 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse14 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse14 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse15) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse15 (select |c_#memory_int| .cse15)) |c_#memory_int|))))) (or (exists ((v_prenex_28 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse16 (store |c_#valid| v_prenex_28 0))) (and (= (select .cse16 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse16 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse17 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse17 (select |c_#memory_int| .cse17)) |c_#memory_int|) (= (select (store |c_#valid| .cse17 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((v_prenex_28 Int)) (= (select (store |c_#valid| v_prenex_28 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse18 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_6|)) (.cse19 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse18 (select |v_#memory_int_BEFORE_CALL_6| .cse18))) (= (select (store |c_#valid| .cse18 0) .cse19) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse19 (select |c_#memory_int| .cse19)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (let ((.cse20 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse20 (select |c_#memory_int| .cse20)) |c_#memory_int|) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse20) 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|))) is different from false [2024-11-28 02:50:14,407 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_#memory_int| |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int)) (let ((.cse0 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| v_prenex_2 0) .cse0) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse0 (select |c_#memory_int| .cse0)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |v_#memory_int_BEFORE_CALL_6|)) (.cse2 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse1 (select |v_#memory_int_BEFORE_CALL_6| .cse1))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse2 (select |c_#memory_int| .cse2))) (= (select (store |c_#valid| .cse1 0) .cse2) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse3 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store |c_#valid| .cse3 0) |s_alloc_state_~#required_bytes~3#1.base|) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse3 (select |c_#memory_int| .cse3)))))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse4) 1)) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (not (= .cse4 |s_alloc_state_~#required_bytes~3#1.base|)) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) |s_alloc_state_~#required_bytes~3#1.base|) 1))) (exists ((|v_old(#memory_int)_BEFORE_CALL_6| (Array Int (Array Int Int))) (v_prenex_2 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse5 (store |c_#valid| v_prenex_2 0)) (.cse6 (@diff |v_old(#memory_int)_BEFORE_CALL_6| |c_#memory_int|))) (and (= (select (store (store .cse5 .cse6 0) |s_alloc_state_~#required_bytes~3#1.base| 1) .cse6) 0) (= (select .cse5 .cse6) 1) (= |c_#memory_int| (store |v_old(#memory_int)_BEFORE_CALL_6| .cse6 (select |c_#memory_int| .cse6))))))) (let ((.cse7 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse8 (= (store |c_old(#memory_int)| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|))) (or (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|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| .cse7 0)))) .cse8) (and (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (and (= 0 (select |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base|)) (= (store |c_old(#valid)| |s_alloc_state_~#required_bytes~3#1.base| 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0)))) (= |c_old(#memory_int)| |c_#memory_int|)) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (= (store |c_old(#valid)| .cse7 1) (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0))) (= (select |c_old(#valid)| .cse7) 0))) .cse8) (exists ((|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |c_old(#memory_int)| |v_#memory_int_BEFORE_CALL_6|)) (.cse10 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| .cse9 (select |v_#memory_int_BEFORE_CALL_6| .cse9)) |v_#memory_int_BEFORE_CALL_6|) (= (select |c_old(#valid)| .cse10) 0) (= (store |c_old(#valid)| .cse10 1) (store |c_#valid| .cse9 0)) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse10 (select |c_#memory_int| .cse10))))))))) (or (exists ((v_prenex_15 Int)) (= (select (store |c_#valid| v_prenex_15 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse11 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse11 (select |c_#memory_int| .cse11)) |c_#memory_int|) (= (select (store |c_#valid| .cse11 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |v_#memory_int_BEFORE_CALL_6|)) (.cse13 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse12 (select |v_#memory_int_BEFORE_CALL_6| .cse12)) |v_#memory_int_BEFORE_CALL_6|) (= (select (store |c_#valid| .cse12 0) .cse13) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse13 (select |c_#memory_int| .cse13)))))) (exists ((v_prenex_15 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse14 (store |c_#valid| v_prenex_15 0))) (and (= (select .cse14 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse14 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_old(#memory_int)_BEFORE_CALL_7| |c_#memory_int|))) (and (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse15) 1) (= (store |v_old(#memory_int)_BEFORE_CALL_7| .cse15 (select |c_#memory_int| .cse15)) |c_#memory_int|))))) (or (exists ((v_prenex_28 Int) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse16 (store |c_#valid| v_prenex_28 0))) (and (= (select .cse16 |s_alloc_state_~#required_bytes~3#1.base|) 1) (= (select (store (store .cse16 |s_alloc_state_~#required_bytes~3#1.base| 0) .cse4 1) |s_alloc_state_~#required_bytes~3#1.base|) 0)))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|s_alloc_state_~#required_bytes~3#1.base| Int)) (let ((.cse17 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse17 (select |c_#memory_int| .cse17)) |c_#memory_int|) (= (select (store |c_#valid| .cse17 0) |s_alloc_state_~#required_bytes~3#1.base|) 1)))) (exists ((v_prenex_28 Int)) (= (select (store |c_#valid| v_prenex_28 0) .cse4) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse18 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |v_#memory_int_BEFORE_CALL_6|)) (.cse19 (@diff |v_#memory_int_BEFORE_CALL_6| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_6| (store |v_old(#memory_int)_BEFORE_CALL_8| .cse18 (select |v_#memory_int_BEFORE_CALL_6| .cse18))) (= (select (store |c_#valid| .cse18 0) .cse19) 1) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_6| .cse19 (select |c_#memory_int| .cse19)))))) (exists ((|v_old(#memory_int)_BEFORE_CALL_8| (Array Int (Array Int Int))) (|v_hash_table_state_required_bytes_~#elemsize~0.base_11| Int)) (let ((.cse20 (@diff |v_old(#memory_int)_BEFORE_CALL_8| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_BEFORE_CALL_8| .cse20 (select |c_#memory_int| .cse20)) |c_#memory_int|) (= (select (store |c_#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_11| 0) .cse20) 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|))) is different from true [2024-11-28 02:50:39,569 WARN L286 SmtUtils]: Spent 24.81s on a formula simplification. DAG size of input: 962 DAG size of output: 150 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 02:50:39,570 INFO L349 Elim1Store]: treesize reduction 2632, result has 10.4 percent of original size [2024-11-28 02:50:39,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 19 new quantified variables, introduced 179 case distinctions, treesize of input 535 treesize of output 949