/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 13:59:05,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 13:59:05,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 13:59:05,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 13:59:05,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 13:59:06,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 13:59:06,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 13:59:06,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 13:59:06,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 13:59:06,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 13:59:06,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 13:59:06,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 13:59:06,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 13:59:06,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 13:59:06,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 13:59:06,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 13:59:06,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 13:59:06,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 13:59:06,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 13:59:06,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 13:59:06,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 13:59:06,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 13:59:06,016 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 13:59:06,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 13:59:06,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 13:59:06,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 13:59:06,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 13:59:06,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 13:59:06,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 13:59:06,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 13:59:06,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 13:59:06,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 13:59:06,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 13:59:06,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 13:59:06,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 13:59:06,022 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 13:59:06,023 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 13:59:06,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 13:59:06,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 13:59:06,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 13:59:06,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 13:59:06,025 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-05 13:59:06,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 13:59:06,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 13:59:06,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 13:59:06,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 13:59:06,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 13:59:06,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i [2024-11-05 13:59:07,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 13:59:07,727 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 13:59:07,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i [2024-11-05 13:59:07,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f1265b2/01e7bd2314ac4632a011f8083bb3298e/FLAGc2600ef33 [2024-11-05 13:59:07,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f1265b2/01e7bd2314ac4632a011f8083bb3298e [2024-11-05 13:59:07,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 13:59:07,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 13:59:07,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 13:59:07,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 13:59:07,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 13:59:07,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:59:07" (1/1) ... [2024-11-05 13:59:08,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@971a7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:07, skipping insertion in model container [2024-11-05 13:59:08,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:59:07" (1/1) ... [2024-11-05 13:59:08,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 13:59:08,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2024-11-05 13:59:08,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2024-11-05 13:59:08,624 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,701 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,701 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,702 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,714 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,716 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,716 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,716 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,717 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,717 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,718 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,722 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,722 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,734 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,735 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,735 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,735 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,737 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,737 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,737 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,738 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,739 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,739 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,739 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,740 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,741 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,742 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:08,947 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,947 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,947 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:08,948 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 13:59:09,063 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 13:59:09,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 13:59:09,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2024-11-05 13:59:09,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2024-11-05 13:59:09,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,122 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,122 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,127 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,127 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,128 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,128 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,130 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,130 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,131 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,132 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,132 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,133 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,133 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,140 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,140 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,140 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,140 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,145 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,146 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,146 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,146 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,147 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,147 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,147 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,148 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,148 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,148 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,207 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,207 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,207 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,208 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:09,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 13:59:09,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 13:59:09,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2024-11-05 13:59:09,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2024-11-05 13:59:09,317 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,317 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,317 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,317 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,318 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,324 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,324 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,325 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,325 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,325 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,325 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,326 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,326 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:09,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 13:59:09,500 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 13:59:09,507 INFO L204 MainTranslator]: Completed translation [2024-11-05 13:59:09,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09 WrapperNode [2024-11-05 13:59:09,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 13:59:09,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 13:59:09,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 13:59:09,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 13:59:09,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,586 INFO L138 Inliner]: procedures = 687, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 77 [2024-11-05 13:59:09,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 13:59:09,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 13:59:09,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 13:59:09,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 13:59:09,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,617 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-05 13:59:09,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 13:59:09,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 13:59:09,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 13:59:09,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 13:59:09,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (1/1) ... [2024-11-05 13:59:09,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 13:59:09,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 13:59:09,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 13:59:09,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 13:59:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 13:59:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 13:59:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 13:59:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 13:59:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 13:59:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 13:59:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 13:59:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 13:59:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 13:59:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 13:59:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 13:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 13:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 13:59:09,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 13:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 13:59:09,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 13:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-05 13:59:09,690 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-05 13:59:09,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 13:59:09,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 13:59:10,379 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-05 13:59:10,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 13:59:10,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 13:59:10,388 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-05 13:59:10,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:59:10 BoogieIcfgContainer [2024-11-05 13:59:10,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 13:59:10,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 13:59:10,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 13:59:10,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 13:59:10,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 01:59:07" (1/3) ... [2024-11-05 13:59:10,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb62f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:59:10, skipping insertion in model container [2024-11-05 13:59:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:09" (2/3) ... [2024-11-05 13:59:10,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb62f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:59:10, skipping insertion in model container [2024-11-05 13:59:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:59:10" (3/3) ... [2024-11-05 13:59:10,393 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2024-11-05 13:59:10,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 13:59:10,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 13:59:10,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 13:59:10,453 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;@70bb89fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 13:59:10,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 13:59:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 13:59:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-05 13:59:10,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:10,462 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 13:59:10,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 901746988, now seen corresponding path program 1 times [2024-11-05 13:59:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:10,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923775501] [2024-11-05 13:59:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:10,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:10,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-05 13:59:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:10,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 13:59:10,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:10,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 13:59:10,662 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923775501] [2024-11-05 13:59:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923775501] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:10,663 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 13:59:10,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658053122] [2024-11-05 13:59:10,664 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 13:59:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 13:59:10,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 13:59:10,684 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 13:59:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:10,701 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2024-11-05 13:59:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 13:59:10,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-11-05 13:59:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:10,708 INFO L225 Difference]: With dead ends: 122 [2024-11-05 13:59:10,708 INFO L226 Difference]: Without dead ends: 58 [2024-11-05 13:59:10,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-05 13:59:10,712 INFO L432 NwaCegarLoop]: 82 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, 82 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-05 13:59:10,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 13:59:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-05 13:59:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-05 13:59:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-05 13:59:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-05 13:59:10,739 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 34 [2024-11-05 13:59:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:10,739 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-05 13:59:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 13:59:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-05 13:59:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-05 13:59:10,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:10,741 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 13:59:10,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-05 13:59:10,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:10,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash 99533352, now seen corresponding path program 1 times [2024-11-05 13:59:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1174338531] [2024-11-05 13:59:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:10,943 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:10,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:10,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-05 13:59:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:11,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-05 13:59:11,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:11,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2024-11-05 13:59:11,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-05 13:59:11,236 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-05 13:59:11,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2024-11-05 13:59:11,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 13:59:11,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 13:59:11,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 13:59:11,959 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-05 13:59:11,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 701 treesize of output 462 [2024-11-05 13:59:11,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 13:59:11,989 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-05 13:59:11,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 59 [2024-11-05 13:59:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:12,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 13:59:20,018 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1174338531] [2024-11-05 13:59:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1174338531] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:20,018 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 20 [2024-11-05 13:59:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980938579] [2024-11-05 13:59:20,018 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-05 13:59:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-05 13:59:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-05 13:59:20,020 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 20 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 13:59:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:33,559 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2024-11-05 13:59:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 13:59:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2024-11-05 13:59:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:33,563 INFO L225 Difference]: With dead ends: 79 [2024-11-05 13:59:33,563 INFO L226 Difference]: Without dead ends: 77 [2024-11-05 13:59:33,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-11-05 13:59:33,564 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:33,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 577 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2024-11-05 13:59:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-05 13:59:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-05 13:59:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 7 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-05 13:59:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-05 13:59:33,582 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 34 [2024-11-05 13:59:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:33,582 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-05 13:59:33,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 13:59:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-05 13:59:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-05 13:59:33,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:33,583 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 13:59:33,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Forceful destruction successful, exit code 0 [2024-11-05 13:59:33,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:33,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:33,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash -709813274, now seen corresponding path program 1 times [2024-11-05 13:59:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:33,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585972094] [2024-11-05 13:59:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:33,784 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:33,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:33,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:33,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-05 13:59:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:33,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-05 13:59:33,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:33,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-05 13:59:33,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2024-11-05 13:59:34,798 INFO L349 Elim1Store]: treesize reduction 692, result has 4.7 percent of original size [2024-11-05 13:59:34,799 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 1419 treesize of output 836 [2024-11-05 13:59:34,854 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2024-11-05 13:59:34,855 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 98 [2024-11-05 13:59:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:37,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 13:59:38,040 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1585972094] [2024-11-05 13:59:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1585972094] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:38,040 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2024-11-05 13:59:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387456151] [2024-11-05 13:59:38,040 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 13:59:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:38,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 13:59:38,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-05 13:59:38,041 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 13:59:50,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 13:59:59,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 14:00:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 14:00:00,840 INFO L93 Difference]: Finished difference Result 149 states and 198 transitions. [2024-11-05 14:00:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 14:00:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2024-11-05 14:00:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 14:00:00,843 INFO L225 Difference]: With dead ends: 149 [2024-11-05 14:00:00,843 INFO L226 Difference]: Without dead ends: 83 [2024-11-05 14:00:00,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2024-11-05 14:00:00,845 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 124 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-05 14:00:00,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 272 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2024-11-05 14:00:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-05 14:00:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-05 14:00:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 21 states have call successors, (21), 6 states have call predecessors, (21), 8 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-11-05 14:00:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2024-11-05 14:00:00,871 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 34 [2024-11-05 14:00:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 14:00:00,871 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2024-11-05 14:00:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 14:00:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2024-11-05 14:00:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-05 14:00:00,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 14:00:00,872 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 14:00:00,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-05 14:00:01,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 14:00:01,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 14:00:01,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 14:00:01,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1102840284, now seen corresponding path program 1 times [2024-11-05 14:00:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 14:00:01,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [403472627] [2024-11-05 14:00:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 14:00:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 14:00:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 14:00:01,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 14:00:01,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-05 14:00:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 14:00:01,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 14:00:01,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 14:00:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 14:00:01,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 14:00:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 14:00:01,380 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 14:00:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [403472627] [2024-11-05 14:00:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [403472627] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 14:00:01,380 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 14:00:01,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 14:00:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71008545] [2024-11-05 14:00:01,381 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 14:00:01,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 14:00:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 14:00:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 14:00:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 14:00:01,382 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 14:00:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 14:00:01,809 INFO L93 Difference]: Finished difference Result 153 states and 205 transitions. [2024-11-05 14:00:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 14:00:01,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 34 [2024-11-05 14:00:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 14:00:01,811 INFO L225 Difference]: With dead ends: 153 [2024-11-05 14:00:01,811 INFO L226 Difference]: Without dead ends: 80 [2024-11-05 14:00:01,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 14:00:01,812 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 14:00:01,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 337 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 14:00:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-05 14:00:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-05 14:00:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-05 14:00:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2024-11-05 14:00:01,836 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 34 [2024-11-05 14:00:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 14:00:01,836 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2024-11-05 14:00:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 14:00:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2024-11-05 14:00:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 14:00:01,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 14:00:01,837 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 14:00:01,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Forceful destruction successful, exit code 0 [2024-11-05 14:00:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 14:00:02,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 14:00:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 14:00:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 623664027, now seen corresponding path program 1 times [2024-11-05 14:00:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 14:00:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148585600] [2024-11-05 14:00:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 14:00:02,039 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 14:00:02,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 14:00:02,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 14:00:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Waiting until timeout for monitored process [2024-11-05 14:00:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 14:00:02,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-05 14:00:02,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 14:00:02,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-05 14:00:02,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2024-11-05 14:00:02,942 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-05 14:00:02,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2024-11-05 14:00:03,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 14:00:03,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 14:00:03,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 14:00:04,095 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-05 14:00:04,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 393 treesize of output 263 [2024-11-05 14:00:04,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 14:00:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 14:00:04,128 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-05 14:00:04,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 57 [2024-11-05 14:00:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 14:00:07,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 14:00:21,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_node_next_is_valid_~node.base) c_aws_linked_list_node_next_is_valid_~node.offset)) (.cse3 (bvadd (select (select |c_#memory_$Pointer$#2.offset| c_aws_linked_list_node_next_is_valid_~node.base) c_aws_linked_list_node_next_is_valid_~node.offset) (_ bv8 64)))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)))) (and (= |c_aws_linked_list_node_next_is_valid_#in~node.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.offset|))) (not (= c_aws_linked_list_node_next_is_valid_~node.offset (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3))) (not (= c_aws_linked_list_node_next_is_valid_~node.base (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (forall ((|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21| (let ((.cse4 (bvadd (_ bv8 64) |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21|))) (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse4)) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse4))))) (forall ((|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21| (_ BitVec 64))) (= (let ((.cse5 (bvadd (_ bv8 64) |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse5)) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse5))) |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|))))) is different from false [2024-11-05 14:00:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 14:00:22,590 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 14:00:22,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148585600] [2024-11-05 14:00:22,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [148585600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 14:00:22,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 14:00:22,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 39 [2024-11-05 14:00:22,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139569378] [2024-11-05 14:00:22,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 14:00:22,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-05 14:00:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 14:00:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-05 14:00:22,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1267, Unknown=2, NotChecked=72, Total=1482 [2024-11-05 14:00:22,592 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 39 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 11 states have call successors, (14), 5 states have call predecessors, (14), 10 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-05 14:00:41,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-05 14:00:45,346 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse8 (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)))) (and (= |c_aws_linked_list_node_next_is_valid_#in~node.base| (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse8)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse8) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)))) (.cse1 (and (forall ((|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21| (let ((.cse5 (bvadd (_ bv8 64) |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21|))) (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse5)) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse5))))) (forall ((|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21| (_ BitVec 64))) (= (let ((.cse6 (bvadd (_ bv8 64) |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset_BEFORE_CALL_21|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse6)) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|) .cse6))) |v_ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base_BEFORE_CALL_21|))))) (and (or .cse0 (not |c_aws_linked_list_node_next_is_valid_#t~short303|) .cse1) (= |c_aws_linked_list_node_next_is_valid_#in~node.base| c_aws_linked_list_node_next_is_valid_~node.base) (= c_aws_linked_list_node_next_is_valid_~node.offset |c_aws_linked_list_node_next_is_valid_#in~node.offset|) (or .cse0 (= (_ bv0 8) |c_aws_linked_list_node_next_is_valid_#res|) .cse1) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_22| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_22|) (_ bv0 64)))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_22|) (_ bv0 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| .cse2) (_ bv8 64))) (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#2.base| .cse2) (_ bv8 64))) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_22| .cse2))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_node_next_is_valid_~node.base) c_aws_linked_list_node_next_is_valid_~node.offset)) (.cse4 (bvadd (select (select |c_#memory_$Pointer$#2.offset| c_aws_linked_list_node_next_is_valid_~node.base) c_aws_linked_list_node_next_is_valid_~node.offset) (_ bv8 64)))) (or .cse0 (not (= c_aws_linked_list_node_next_is_valid_~node.offset (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4))) (not (= c_aws_linked_list_node_next_is_valid_~node.base (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) .cse1)))) is different from false