./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 59c6b72a732d91c045894268c659507998ee445c19bfbe580f6574a50ad495ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:17:53,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:17:53,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:17:53,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:17:53,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:17:54,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:17:54,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:17:54,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:17:54,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:17:54,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:17:54,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:17:54,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:17:54,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:17:54,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:17:54,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:17:54,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:17:54,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:17:54,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:17:54,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:17:54,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:17:54,008 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 59c6b72a732d91c045894268c659507998ee445c19bfbe580f6574a50ad495ad [2025-02-06 05:17:54,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:17:54,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:17:54,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:17:54,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:17:54,332 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:17:54,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2025-02-06 05:17:55,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64b117ae6/aee7e225eee94b67a297f4a928ba79e7/FLAG9818ca47b [2025-02-06 05:17:56,241 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:17:56,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2025-02-06 05:17:56,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64b117ae6/aee7e225eee94b67a297f4a928ba79e7/FLAG9818ca47b [2025-02-06 05:17:56,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64b117ae6/aee7e225eee94b67a297f4a928ba79e7 [2025-02-06 05:17:56,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:17:56,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:17:56,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:17:56,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:17:56,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:17:56,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:17:56" (1/1) ... [2025-02-06 05:17:56,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ae90d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:56, skipping insertion in model container [2025-02-06 05:17:56,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:17:56" (1/1) ... [2025-02-06 05:17:56,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:17:56,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2025-02-06 05:17:56,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2025-02-06 05:17:57,352 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,354 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,354 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,355 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,366 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,367 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,369 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,369 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,373 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[150856,150869] [2025-02-06 05:17:57,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:17:57,853 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:17:57,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2025-02-06 05:17:57,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2025-02-06 05:17:57,914 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,915 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,915 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,915 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,916 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,923 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,924 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,926 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,926 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,927 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:57,927 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:58,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[150856,150869] [2025-02-06 05:17:58,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:17:58,202 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:17:58,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58 WrapperNode [2025-02-06 05:17:58,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:17:58,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:17:58,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:17:58,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:17:58,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,319 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 86 [2025-02-06 05:17:58,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:17:58,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:17:58,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:17:58,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:17:58,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,358 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 5, 23]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 7 writes are split as follows [0, 0, 7]. [2025-02-06 05:17:58,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:17:58,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:17:58,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:17:58,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:17:58,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (1/1) ... [2025-02-06 05:17:58,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:17:58,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:58,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 05:17:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 05:17:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-06 05:17:58,468 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-06 05:17:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-02-06 05:17:58,468 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-02-06 05:17:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:17:58,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:58,469 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:17:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:17:58,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 05:17:58,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 05:17:58,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 05:17:58,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 05:17:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:17:58,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:17:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:17:58,471 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:17:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:17:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:17:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:17:58,732 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:17:58,735 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:17:58,790 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-02-06 05:17:58,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-02-06 05:17:59,111 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-06 05:17:59,111 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:17:59,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:17:59,124 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:17:59,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:59 BoogieIcfgContainer [2025-02-06 05:17:59,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:17:59,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:17:59,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:17:59,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:17:59,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:17:56" (1/3) ... [2025-02-06 05:17:59,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4617b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:17:59, skipping insertion in model container [2025-02-06 05:17:59,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:58" (2/3) ... [2025-02-06 05:17:59,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4617b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:17:59, skipping insertion in model container [2025-02-06 05:17:59,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:59" (3/3) ... [2025-02-06 05:17:59,137 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2025-02-06 05:17:59,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:17:59,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_remove_harness_negated.i that has 10 procedures, 81 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 05:17:59,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:17:59,219 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;@7ff593d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:17:59,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:17:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 05:17:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 05:17:59,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:59,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:59,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:59,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1171501549, now seen corresponding path program 1 times [2025-02-06 05:17:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080800447] [2025-02-06 05:17:59,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:59,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 05:17:59,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 05:17:59,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:59,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:17:59,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:59,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080800447] [2025-02-06 05:17:59,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080800447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163488435] [2025-02-06 05:17:59,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:59,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:17:59,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 05:17:59,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 05:17:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 05:17:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:59,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:59,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:17:59,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:17:59,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163488435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:17:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055544582] [2025-02-06 05:17:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:59,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:17:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:59,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:17:59,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:17:59,926 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 05:17:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:59,952 INFO L93 Difference]: Finished difference Result 140 states and 190 transitions. [2025-02-06 05:17:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:17:59,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-02-06 05:17:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:59,961 INFO L225 Difference]: With dead ends: 140 [2025-02-06 05:17:59,962 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 05:17:59,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:17:59,968 INFO L435 NwaCegarLoop]: 90 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, 90 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 [2025-02-06 05:17:59,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:17:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 05:17:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 05:17:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 44 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 05:18:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-02-06 05:18:00,005 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 47 [2025-02-06 05:18:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:00,008 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-02-06 05:18:00,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 05:18:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-02-06 05:18:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 05:18:00,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:00,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:00,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:18:00,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 05:18:00,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -708998486, now seen corresponding path program 1 times [2025-02-06 05:18:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448376480] [2025-02-06 05:18:00,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:00,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 05:18:00,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 05:18:00,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:00,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:18:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:01,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448376480] [2025-02-06 05:18:01,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448376480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:01,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:18:01,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 05:18:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393830246] [2025-02-06 05:18:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:18:01,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:01,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:18:01,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:18:01,074 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:01,334 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2025-02-06 05:18:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:18:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2025-02-06 05:18:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:01,336 INFO L225 Difference]: With dead ends: 136 [2025-02-06 05:18:01,337 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 05:18:01,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:18:01,338 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:01,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 445 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:18:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 05:18:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-02-06 05:18:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-02-06 05:18:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-02-06 05:18:01,348 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 54 [2025-02-06 05:18:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:01,348 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-02-06 05:18:01,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-02-06 05:18:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 05:18:01,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:01,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:01,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:18:01,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:01,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1301105355, now seen corresponding path program 1 times [2025-02-06 05:18:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:01,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035436335] [2025-02-06 05:18:01,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:01,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 05:18:01,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 05:18:01,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:01,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:18:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:01,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035436335] [2025-02-06 05:18:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035436335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:18:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:18:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848275219] [2025-02-06 05:18:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:18:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:01,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:18:01,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:18:01,667 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:01,696 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2025-02-06 05:18:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:18:01,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2025-02-06 05:18:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:01,700 INFO L225 Difference]: With dead ends: 128 [2025-02-06 05:18:01,700 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 05:18:01,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:18:01,702 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:01,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 05:18:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-06 05:18:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 50 states have internal predecessors, (58), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-02-06 05:18:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-02-06 05:18:01,715 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 54 [2025-02-06 05:18:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:01,716 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-02-06 05:18:01,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2025-02-06 05:18:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 05:18:01,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:01,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:18:01,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:01,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 373398422, now seen corresponding path program 1 times [2025-02-06 05:18:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068015522] [2025-02-06 05:18:01,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 05:18:01,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 05:18:01,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:01,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:18:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:02,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068015522] [2025-02-06 05:18:02,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068015522] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:02,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373750353] [2025-02-06 05:18:02,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:02,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:18:02,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 05:18:02,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 05:18:02,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 05:18:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:02,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 05:18:02,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:18:02,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:18:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373750353] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:18:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-02-06 05:18:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998348512] [2025-02-06 05:18:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:18:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:02,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:18:02,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:18:02,531 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 05:18:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:02,565 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2025-02-06 05:18:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:18:02,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2025-02-06 05:18:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:02,568 INFO L225 Difference]: With dead ends: 123 [2025-02-06 05:18:02,570 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 05:18:02,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:18:02,571 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 161 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:02,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 05:18:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-02-06 05:18:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-02-06 05:18:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2025-02-06 05:18:02,587 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 55 [2025-02-06 05:18:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:02,588 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2025-02-06 05:18:02,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 05:18:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2025-02-06 05:18:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 05:18:02,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:02,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:02,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:02,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:02,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1051721112, now seen corresponding path program 1 times [2025-02-06 05:18:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107647057] [2025-02-06 05:18:02,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 05:18:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 05:18:02,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:02,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:18:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107647057] [2025-02-06 05:18:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107647057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:03,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:18:03,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:18:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272523247] [2025-02-06 05:18:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:18:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:03,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:18:03,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:18:03,192 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 05:18:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:03,248 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2025-02-06 05:18:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:18:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2025-02-06 05:18:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:03,250 INFO L225 Difference]: With dead ends: 85 [2025-02-06 05:18:03,250 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 05:18:03,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:18:03,251 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:03,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 399 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 05:18:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-02-06 05:18:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 56 states have internal predecessors, (63), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-02-06 05:18:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2025-02-06 05:18:03,268 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 56 [2025-02-06 05:18:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:03,269 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2025-02-06 05:18:03,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 05:18:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2025-02-06 05:18:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 05:18:03,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:03,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:18:03,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2103583049, now seen corresponding path program 1 times [2025-02-06 05:18:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533616662] [2025-02-06 05:18:03,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 05:18:03,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 05:18:03,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:03,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:18:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533616662] [2025-02-06 05:18:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533616662] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925953916] [2025-02-06 05:18:03,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:03,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:03,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:03,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:18:03,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 05:18:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 05:18:03,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 05:18:03,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:03,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:03,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 05:18:03,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:18:03,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:18:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925953916] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:18:03,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:18:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 05:18:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288066513] [2025-02-06 05:18:03,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:03,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:18:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:03,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:18:03,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:18:03,987 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:18:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:04,083 INFO L93 Difference]: Finished difference Result 149 states and 183 transitions. [2025-02-06 05:18:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:18:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 57 [2025-02-06 05:18:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:04,085 INFO L225 Difference]: With dead ends: 149 [2025-02-06 05:18:04,085 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 05:18:04,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:18:04,086 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:04,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 05:18:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 05:18:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-02-06 05:18:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2025-02-06 05:18:04,097 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 57 [2025-02-06 05:18:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:04,098 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2025-02-06 05:18:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:18:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2025-02-06 05:18:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 05:18:04,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:04,101 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:04,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 05:18:04,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:04,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -649969812, now seen corresponding path program 2 times [2025-02-06 05:18:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436690703] [2025-02-06 05:18:04,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:18:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:04,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-06 05:18:04,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 05:18:04,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:18:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:18:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436690703] [2025-02-06 05:18:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436690703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:04,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045993796] [2025-02-06 05:18:04,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:18:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:04,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:18:04,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 05:18:04,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-06 05:18:04,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 05:18:04,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:18:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:04,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 05:18:04,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:18:05,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 05:18:05,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045993796] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:18:05,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:18:05,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 16 [2025-02-06 05:18:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093291046] [2025-02-06 05:18:05,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 05:18:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:05,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 05:18:05,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-06 05:18:05,174 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:18:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:05,411 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2025-02-06 05:18:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 05:18:05,411 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2025-02-06 05:18:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:05,412 INFO L225 Difference]: With dead ends: 164 [2025-02-06 05:18:05,412 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 05:18:05,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-02-06 05:18:05,414 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 19 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:05,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 560 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:18:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 05:18:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2025-02-06 05:18:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-02-06 05:18:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2025-02-06 05:18:05,433 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 60 [2025-02-06 05:18:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:05,435 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2025-02-06 05:18:05,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:18:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2025-02-06 05:18:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 05:18:05,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:05,436 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 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] [2025-02-06 05:18:05,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 05:18:05,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 05:18:05,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash -361516252, now seen corresponding path program 1 times [2025-02-06 05:18:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:05,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713137596] [2025-02-06 05:18:05,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:05,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 05:18:05,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 05:18:05,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:18:06,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713137596] [2025-02-06 05:18:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713137596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304726385] [2025-02-06 05:18:06,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:06,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:06,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:18:06,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 05:18:06,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 05:18:06,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 05:18:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:06,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-06 05:18:06,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:06,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:06,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2025-02-06 05:18:06,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:06,404 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 [2025-02-06 05:18:06,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2025-02-06 05:18:06,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2025-02-06 05:18:06,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:06,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:06,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2025-02-06 05:18:06,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 137 [2025-02-06 05:18:06,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 05:18:06,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2025-02-06 05:18:06,570 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 0 case distinctions, treesize of input 78 treesize of output 43 [2025-02-06 05:18:06,595 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-06 05:18:06,595 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 1 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 05:18:06,614 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2025-02-06 05:18:06,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2025-02-06 05:18:06,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:07,279 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (<= 2 .cse1) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int) (v_ArrVal_915 Int)) (let ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2)) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse7 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse11 (select .cse9 .cse10))) (and (<= 2 .cse7) (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse8) .cse10 .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse7)) (<= 2 .cse8) (<= .cse7 .cse11))))))) is different from true [2025-02-06 05:18:08,374 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (<= 2 .cse1) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int) (v_ArrVal_915 Int)) (let ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2)) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse7 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse11 (select .cse9 .cse10))) (and (<= 2 .cse7) (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse8) .cse10 .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse7)) (<= 2 .cse8) (<= .cse7 .cse11))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse12 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse14 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse12 .cse13)) (= .cse14 (store (select (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3))) (let ((.cse15 (store (select (store (store .cse16 .cse12 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse12) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse12 .cse15) .cse13 (store (select (store (store .cse16 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse12 .cse15) .cse13) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse12)))) .cse12) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse13)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse13) (<= 2 .cse12) (not (= .cse13 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse18 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse20 (select .cse21 .cse19)) (.cse17 (select .cse21 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse17 .cse18)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) .cse17 v_arrayElimArr_2) .cse18) .cse19 .cse20) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse17) .cse21) (<= 2 .cse18) (<= .cse17 .cse20) (<= 2 .cse17)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse22 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 .cse22) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| (select .cse23 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse22)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) is different from true [2025-02-06 05:18:09,990 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (<= 2 .cse1) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int) (v_ArrVal_915 Int)) (let ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2)) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse7 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse11 (select .cse9 .cse10))) (and (<= 2 .cse7) (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse8) .cse10 .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse7)) (<= 2 .cse8) (<= .cse7 .cse11))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse14 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse14)) (.cse16 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse13 (select .cse15 .cse16)) (.cse12 (select .cse15 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= .cse12 .cse13) (<= 2 .cse12) (not (= .cse14 .cse12)) (<= 2 .cse14) (= .cse15 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse14) .cse16 .cse13) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse12))))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse17 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= 2 .cse17) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| (select .cse18 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse17)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse20 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse20))) (let ((.cse19 (select .cse21 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse19 .cse20)) (<= 2 .cse19) (<= 2 .cse20) (= .cse21 (store (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_3))) (let ((.cse22 (store (select (store (store .cse23 .cse20 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse20) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse20 .cse22) .cse19 (store (select (store (store .cse23 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse20 .cse22) .cse19) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse20)))) .cse20) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse19)) (not (= .cse19 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse24 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse24))) (let ((.cse25 (select .cse26 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse24 .cse25)) (= .cse26 (store (select (let ((.cse28 (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3))) (let ((.cse27 (store (select (store (store .cse28 .cse24 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse24) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse24 .cse27) .cse25 (store (select (store (store .cse28 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse24 .cse27) .cse25) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse24)))) .cse24) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse25)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse25) (<= 2 .cse24) (not (= .cse25 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse30 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse33 (select |c_#memory_$Pointer$#2.base| .cse30)) (.cse31 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse32 (select .cse33 .cse31)) (.cse29 (select .cse33 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse29 .cse30)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse30 v_DerPreprocessor_1) .cse29 v_arrayElimArr_2) .cse30) .cse31 .cse32) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse29) .cse33) (<= 2 .cse30) (<= .cse29 .cse32) (<= 2 .cse29)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse34 (select .cse35 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 .cse34) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| (select .cse35 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse34)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) is different from true [2025-02-06 05:18:11,244 WARN L873 $PredicateComparison]: unable to prove that (and (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (<= 2 .cse1) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int) (v_ArrVal_915 Int)) (let ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2)) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse7 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse11 (select .cse9 .cse10))) (and (<= 2 .cse7) (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse8) .cse10 .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse7)) (<= 2 .cse8) (<= .cse7 .cse11))))))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse19 (+ |c_aws_linked_list_remove_~node#1.offset| 8)) (.cse17 (select .cse15 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse12 (<= 2 .cse17)) (.cse13 (not (= .cse17 |c_aws_linked_list_remove_~node#1.base|))) (.cse14 (select .cse15 .cse19))) (or (and .cse12 .cse13 (<= |c_aws_linked_list_remove_~node#1.base| .cse14)) (and .cse12 .cse13 (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (= .cse15 (store (select (let ((.cse18 (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_3))) (let ((.cse16 (store (select (store (store .cse18 |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base|) .cse19 v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base| .cse16) .cse17 (store (select (store (store .cse18 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base| .cse16) .cse17) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) |c_aws_linked_list_remove_~node#1.base|)))) |c_aws_linked_list_remove_~node#1.base|) |c_aws_linked_list_remove_~node#1.offset| .cse17)) (not (= .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))) (and .cse12 .cse13 (<= .cse17 .cse14) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_1) .cse17 v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse19 .cse14) |c_aws_linked_list_remove_~node#1.offset| .cse17) .cse15)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse22 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse21 (select .cse23 .cse24)) (.cse20 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= .cse20 .cse21) (<= 2 .cse20) (not (= .cse22 .cse20)) (<= 2 .cse22) (= .cse23 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) .cse20 v_arrayElimArr_2) .cse22) .cse24 .cse21) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse20))))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse25 (select .cse26 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= 2 .cse25) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| (select .cse26 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse25)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse28 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| .cse28))) (let ((.cse27 (select .cse29 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse27 .cse28)) (<= 2 .cse27) (<= 2 .cse28) (= .cse29 (store (select (let ((.cse31 (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_3))) (let ((.cse30 (store (select (store (store .cse31 .cse28 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse28) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse28 .cse30) .cse27 (store (select (store (store .cse31 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse28 .cse30) .cse27) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse28)))) .cse28) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse27)) (not (= .cse27 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse32 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| .cse32))) (let ((.cse33 (select .cse34 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse32 .cse33)) (= .cse34 (store (select (let ((.cse36 (store |c_#memory_$Pointer$#2.base| .cse33 v_DerPreprocessor_3))) (let ((.cse35 (store (select (store (store .cse36 .cse32 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse32) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse32 .cse35) .cse33 (store (select (store (store .cse36 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse32 .cse35) .cse33) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse32)))) .cse32) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse33)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse33) (<= 2 .cse32) (not (= .cse33 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse38 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse41 (select |c_#memory_$Pointer$#2.base| .cse38)) (.cse39 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse40 (select .cse41 .cse39)) (.cse37 (select .cse41 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse37 .cse38)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse38 v_DerPreprocessor_1) .cse37 v_arrayElimArr_2) .cse38) .cse39 .cse40) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse37) .cse41) (<= 2 .cse38) (<= .cse37 .cse40) (<= 2 .cse37)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse43 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse42 (select .cse43 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 .cse42) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| (select .cse43 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse42)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) is different from true [2025-02-06 05:18:11,538 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (<= 2 .cse1) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int) (v_ArrVal_915 Int)) (let ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2)) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse7 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse11 (select .cse9 .cse10))) (and (<= 2 .cse7) (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse8) .cse10 .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse7)) (<= 2 .cse8) (<= .cse7 .cse11))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (<= 2 .cse12) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| (select .cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse12)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse15 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse15))) (let ((.cse14 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse14 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse14 .cse15)) (= (store (select (let ((.cse17 (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_3))) (let ((.cse16 (store (select (store (store .cse17 .cse15 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse15) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse15 .cse16) .cse14 (store (select (store (store .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse15 .cse16) .cse14) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse15)))) .cse15) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse14) .cse18) (<= 2 .cse14) (<= 2 .cse15)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse21 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse21)) (.cse22 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8))) (let ((.cse20 (select .cse23 .cse22)) (.cse19 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (<= .cse19 .cse20) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_1) .cse19 v_arrayElimArr_2) .cse21) .cse22 .cse20) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse19) .cse23) (<= 2 .cse19) (not (= .cse19 .cse21)) (<= 2 .cse21))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse26 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$#2.base| .cse26)) (.cse28 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse25 (select .cse27 .cse28)) (.cse24 (select .cse27 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= .cse24 .cse25) (<= 2 .cse24) (not (= .cse26 .cse24)) (<= 2 .cse26) (= .cse27 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) .cse24 v_arrayElimArr_2) .cse26) .cse28 .cse25) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse24))))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse29 (select .cse30 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= 2 .cse29) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| (select .cse30 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse29)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse32 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse33 (select |c_#memory_$Pointer$#2.base| .cse32))) (let ((.cse31 (select .cse33 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse31 .cse32)) (<= 2 .cse31) (<= 2 .cse32) (= .cse33 (store (select (let ((.cse35 (store |c_#memory_$Pointer$#2.base| .cse31 v_DerPreprocessor_3))) (let ((.cse34 (store (select (store (store .cse35 .cse32 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse32) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse32 .cse34) .cse31 (store (select (store (store .cse35 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse32 .cse34) .cse31) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse32)))) .cse32) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse31)) (not (= .cse31 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse36 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse38 (select |c_#memory_$Pointer$#2.base| .cse36))) (let ((.cse37 (select .cse38 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse36 .cse37)) (= .cse38 (store (select (let ((.cse40 (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3))) (let ((.cse39 (store (select (store (store .cse40 .cse36 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse36) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse36 .cse39) .cse37 (store (select (store (store .cse40 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse36 .cse39) .cse37) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse36)))) .cse36) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse37)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse37) (<= 2 .cse36) (not (= .cse37 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse42 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| .cse42)) (.cse43 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse44 (select .cse45 .cse43)) (.cse41 (select .cse45 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse41 .cse42)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse42 v_DerPreprocessor_1) .cse41 v_arrayElimArr_2) .cse42) .cse43 .cse44) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse41) .cse45) (<= 2 .cse42) (<= .cse41 .cse44) (<= 2 .cse41)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse47 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse46 (select .cse47 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 .cse46) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| (select .cse47 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse46)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) is different from true [2025-02-06 05:18:12,472 WARN L873 $PredicateComparison]: unable to prove that (and (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (<= 2 .cse1) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int) (v_ArrVal_915 Int)) (let ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2)) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse7 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse11 (select .cse9 .cse10))) (and (<= 2 .cse7) (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse8) .cse10 .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse7)) (<= 2 .cse8) (<= .cse7 .cse11))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (<= 2 .cse12) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| (select .cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse12)))))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse15 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse15))) (let ((.cse14 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse14 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse14 .cse15)) (= (store (select (let ((.cse17 (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_3))) (let ((.cse16 (store (select (store (store .cse17 .cse15 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse15) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse15 .cse16) .cse14 (store (select (store (store .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse15 .cse16) .cse14) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse15)))) .cse15) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse14) .cse18) (<= 2 .cse14) (<= 2 .cse15)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse21 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse21)) (.cse22 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8))) (let ((.cse20 (select .cse23 .cse22)) (.cse19 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (<= .cse19 .cse20) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_1) .cse19 v_arrayElimArr_2) .cse21) .cse22 .cse20) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse19) .cse23) (<= 2 .cse19) (not (= .cse19 .cse21)) (<= 2 .cse21))))))) (let ((.cse27 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse31 (+ |c_aws_linked_list_remove_~node#1.offset| 8)) (.cse29 (select .cse27 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse24 (<= 2 .cse29)) (.cse25 (not (= .cse29 |c_aws_linked_list_remove_~node#1.base|))) (.cse26 (select .cse27 .cse31))) (or (and .cse24 .cse25 (<= |c_aws_linked_list_remove_~node#1.base| .cse26)) (and .cse24 .cse25 (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (= .cse27 (store (select (let ((.cse30 (store |c_#memory_$Pointer$#2.base| .cse29 v_DerPreprocessor_3))) (let ((.cse28 (store (select (store (store .cse30 |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base|) .cse31 v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base| .cse28) .cse29 (store (select (store (store .cse30 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base| .cse28) .cse29) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) |c_aws_linked_list_remove_~node#1.base|)))) |c_aws_linked_list_remove_~node#1.base|) |c_aws_linked_list_remove_~node#1.offset| .cse29)) (not (= .cse29 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))) (and .cse24 .cse25 (<= .cse29 .cse26) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_1) .cse29 v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse31 .cse26) |c_aws_linked_list_remove_~node#1.offset| .cse29) .cse27)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse34 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| .cse34)) (.cse36 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse33 (select .cse35 .cse36)) (.cse32 (select .cse35 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= .cse32 .cse33) (<= 2 .cse32) (not (= .cse34 .cse32)) (<= 2 .cse34) (= .cse35 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse34 v_DerPreprocessor_1) .cse32 v_arrayElimArr_2) .cse34) .cse36 .cse33) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse32))))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse38 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse37 (select .cse38 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= 2 .cse37) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| (select .cse38 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse37)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse40 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse41 (select |c_#memory_$Pointer$#2.base| .cse40))) (let ((.cse39 (select .cse41 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse39 .cse40)) (<= 2 .cse39) (<= 2 .cse40) (= .cse41 (store (select (let ((.cse43 (store |c_#memory_$Pointer$#2.base| .cse39 v_DerPreprocessor_3))) (let ((.cse42 (store (select (store (store .cse43 .cse40 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse40) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse40 .cse42) .cse39 (store (select (store (store .cse43 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse40 .cse42) .cse39) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse40)))) .cse40) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse39)) (not (= .cse39 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (v_ArrVal_915 Int)) (let ((.cse44 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse46 (select |c_#memory_$Pointer$#2.base| .cse44))) (let ((.cse45 (select .cse46 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_ArrVal_915) (not (= .cse44 .cse45)) (= .cse46 (store (select (let ((.cse48 (store |c_#memory_$Pointer$#2.base| .cse45 v_DerPreprocessor_3))) (let ((.cse47 (store (select (store (store .cse48 .cse44 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse44) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) v_ArrVal_915))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse44 .cse47) .cse45 (store (select (store (store .cse48 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse44 .cse47) .cse45) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse44)))) .cse44) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse45)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse45) (<= 2 .cse44) (not (= .cse45 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse50 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse53 (select |c_#memory_$Pointer$#2.base| .cse50)) (.cse51 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse52 (select .cse53 .cse51)) (.cse49 (select .cse53 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse49 .cse50)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse50 v_DerPreprocessor_1) .cse49 v_arrayElimArr_2) .cse50) .cse51 .cse52) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse49) .cse53) (<= 2 .cse50) (<= .cse49 .cse52) (<= 2 .cse49)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse55 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse54 (select .cse55 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 .cse54) (<= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| (select .cse55 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse54)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) is different from true [2025-02-06 05:18:13,770 INFO L349 Elim1Store]: treesize reduction 1121, result has 19.4 percent of original size [2025-02-06 05:18:13,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 104 case distinctions, treesize of input 3532 treesize of output 2746 [2025-02-06 05:18:13,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 144 [2025-02-06 05:18:13,935 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 144 [2025-02-06 05:18:14,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 144 [2025-02-06 05:18:14,076 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 144 [2025-02-06 05:18:14,302 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-02-06 05:18:14,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 173 [2025-02-06 05:18:14,359 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 147 treesize of output 137 [2025-02-06 05:18:14,501 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-02-06 05:18:14,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 173 [2025-02-06 05:18:14,551 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 147 treesize of output 137 [2025-02-06 05:18:14,701 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-02-06 05:18:14,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 173 [2025-02-06 05:18:14,753 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 147 treesize of output 137 [2025-02-06 05:18:14,874 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-02-06 05:18:14,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 173 [2025-02-06 05:18:14,924 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 147 treesize of output 137 [2025-02-06 05:18:14,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 116 [2025-02-06 05:18:15,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 116 [2025-02-06 05:18:15,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:15,479 INFO L224 Elim1Store]: Index analysis took 367 ms [2025-02-06 05:18:18,156 INFO L349 Elim1Store]: treesize reduction 324, result has 71.8 percent of original size [2025-02-06 05:18:18,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 104 case distinctions, treesize of input 202 treesize of output 986 [2025-02-06 05:18:18,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 307 treesize of output 229 [2025-02-06 05:18:18,504 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 116 [2025-02-06 05:18:18,627 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 116 [2025-02-06 05:18:18,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 133 [2025-02-06 05:18:19,109 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-02-06 05:18:19,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 143 [2025-02-06 05:18:19,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 115 [2025-02-06 05:18:19,386 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 96 treesize of output 94