./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.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_rbegin_harness.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 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:17:34,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:17:34,650 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:34,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:17:34,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:17:34,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:17:34,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:17:34,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:17:34,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:17:34,687 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:17:34,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:17:34,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:17:34,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:17:34,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:17:34,687 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:17:34,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:17:34,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:17:34,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:17:34,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:17:34,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:17:34,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:17:34,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:17:34,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:17:34,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:17:34,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:17:34,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:17:34,690 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 -> 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 [2025-02-06 05:17:34,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:17:34,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:17:34,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:17:34,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:17:34,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:17:34,903 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_rbegin_harness.i [2025-02-06 05:17:36,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ec1f9373/74f0981cef1c469489703c0dca362053/FLAG7359a90fe [2025-02-06 05:17:36,508 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:17:36,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2025-02-06 05:17:36,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ec1f9373/74f0981cef1c469489703c0dca362053/FLAG7359a90fe [2025-02-06 05:17:36,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ec1f9373/74f0981cef1c469489703c0dca362053 [2025-02-06 05:17:36,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:17:36,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:17:36,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:17:36,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:17:36,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:17:36,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:17:36" (1/1) ... [2025-02-06 05:17:36,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7cb172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:36, skipping insertion in model container [2025-02-06 05:17:36,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:17:36" (1/1) ... [2025-02-06 05:17:36,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:17:36,799 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_rbegin_harness.i[4496,4509] [2025-02-06 05:17:36,804 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_rbegin_harness.i[4556,4569] [2025-02-06 05:17:37,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,251 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,251 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,252 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,260 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,261 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,262 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,262 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,263 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,263 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,539 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_rbegin_harness.i[150476,150489] [2025-02-06 05:17:37,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:17:37,558 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:17:37,571 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_rbegin_harness.i[4496,4509] [2025-02-06 05:17:37,571 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_rbegin_harness.i[4556,4569] [2025-02-06 05:17:37,605 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,605 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,605 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,617 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,618 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,619 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,619 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,622 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,622 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:37,683 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_rbegin_harness.i[150476,150489] [2025-02-06 05:17:37,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:17:37,831 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:17:37,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:37 WrapperNode [2025-02-06 05:17:37,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:17:37,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:17:37,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:17:37,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:17:37,836 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:37" (1/1) ... [2025-02-06 05:17:37,866 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:37" (1/1) ... [2025-02-06 05:17:37,884 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-02-06 05:17:37,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:17:37,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:17:37,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:17:37,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:17:37,891 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:37" (1/1) ... [2025-02-06 05:17:37,891 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:37" (1/1) ... [2025-02-06 05:17:37,894 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:37" (1/1) ... [2025-02-06 05:17:37,909 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-06 05:17:37,909 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:37" (1/1) ... [2025-02-06 05:17:37,909 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:37" (1/1) ... [2025-02-06 05:17:37,917 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:37" (1/1) ... [2025-02-06 05:17:37,922 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:37" (1/1) ... [2025-02-06 05:17:37,924 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:37" (1/1) ... [2025-02-06 05:17:37,925 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:37" (1/1) ... [2025-02-06 05:17:37,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:17:37,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:17:37,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:17:37,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:17:37,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:37" (1/1) ... [2025-02-06 05:17:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:17:37,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:37,964 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:37,966 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:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:17:37,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:37,982 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-06 05:17:37,982 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:17:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:17:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:17:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:17:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:17:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:17:38,147 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:17:38,149 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:17:38,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-02-06 05:17:38,192 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:17:38,336 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-06 05:17:38,351 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-06 05:17:38,351 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:17:38,357 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:17:38,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:17:38,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:38 BoogieIcfgContainer [2025-02-06 05:17:38,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:17:38,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:17:38,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:17:38,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:17:38,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:17:36" (1/3) ... [2025-02-06 05:17:38,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774da74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:17:38, skipping insertion in model container [2025-02-06 05:17:38,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:37" (2/3) ... [2025-02-06 05:17:38,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774da74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:17:38, skipping insertion in model container [2025-02-06 05:17:38,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:38" (3/3) ... [2025-02-06 05:17:38,363 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2025-02-06 05:17:38,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:17:38,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 05:17:38,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:17:38,408 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;@2792dfcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:17:38,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:17:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 05:17:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:17:38,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:38,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:17:38,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:38,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-02-06 05:17:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405243489] [2025-02-06 05:17:38,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:17:38,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:17:38,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 05:17:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405243489] [2025-02-06 05:17:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405243489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712374092] [2025-02-06 05:17:38,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:38,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:38,689 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:38,690 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:38,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:17:38,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:17:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:38,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:17:38,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 05:17:38,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712374092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:17:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002869358] [2025-02-06 05:17:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:38,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:17:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:38,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:17:38,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:17:38,908 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:17:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:38,922 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-02-06 05:17:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:17:38,923 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, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-02-06 05:17:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:38,927 INFO L225 Difference]: With dead ends: 128 [2025-02-06 05:17:38,927 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 05:17:38,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:17:38,930 INFO L435 NwaCegarLoop]: 87 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, 87 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:38,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 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:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 05:17:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 05:17:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 05:17:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-02-06 05:17:38,955 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-02-06 05:17:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:38,955 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-02-06 05:17:38,955 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, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:17:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-02-06 05:17:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:17:38,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:38,961 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:17:38,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:39,162 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:17:39,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:39,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-02-06 05:17:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667990101] [2025-02-06 05:17:39,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:39,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:17:39,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:17:39,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:39,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 05:17:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667990101] [2025-02-06 05:17:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667990101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222427822] [2025-02-06 05:17:39,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:39,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:39,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:39,815 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:17:39,816 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:17:39,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:17:39,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:17:39,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:39,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:39,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 05:17:39,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:40,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-06 05:17:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-02-06 05:17:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:40,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:40,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-02-06 05:17:40,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:40,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:40,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:40,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2025-02-06 05:17:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 05:17:41,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222427822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:41,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:41,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-02-06 05:17:41,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419027980] [2025-02-06 05:17:41,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:17:41,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:41,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:17:41,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 05:17:41,426 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:17:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:41,812 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2025-02-06 05:17:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:17:41,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-02-06 05:17:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:41,814 INFO L225 Difference]: With dead ends: 174 [2025-02-06 05:17:41,814 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 05:17:41,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-06 05:17:41,816 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 59 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:41,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 350 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:17:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 05:17:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-02-06 05:17:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 84 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 05:17:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-02-06 05:17:41,830 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 70 [2025-02-06 05:17:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:41,830 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-02-06 05:17:41,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:17:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-02-06 05:17:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:17:41,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:41,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:17:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 05:17:42,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:42,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:42,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2128292222, now seen corresponding path program 1 times [2025-02-06 05:17:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871077386] [2025-02-06 05:17:42,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:42,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:17:42,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:17:42,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:42,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 05:17:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871077386] [2025-02-06 05:17:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871077386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334401367] [2025-02-06 05:17:42,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:42,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:42,256 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:17:42,257 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:17:42,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:17:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:17:42,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:42,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:42,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 05:17:42,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:42,461 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 05:17:42,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2025-02-06 05:17:42,468 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 26 treesize of output 34 [2025-02-06 05:17:42,475 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 05:17:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 05:17:43,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334401367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2025-02-06 05:17:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124033613] [2025-02-06 05:17:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:43,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 05:17:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:43,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 05:17:43,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-02-06 05:17:43,014 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:17:47,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:17:51,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:17:55,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:17:59,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:18:03,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:18:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:03,633 INFO L93 Difference]: Finished difference Result 187 states and 256 transitions. [2025-02-06 05:18:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 05:18:03,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-02-06 05:18:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:03,635 INFO L225 Difference]: With dead ends: 187 [2025-02-06 05:18:03,635 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 05:18:03,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-02-06 05:18:03,636 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 208 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 56 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:03,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 500 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 308 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-02-06 05:18:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 05:18:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-02-06 05:18:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 86 states have internal predecessors, (110), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 05:18:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-02-06 05:18:03,661 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 70 [2025-02-06 05:18:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:03,661 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-02-06 05:18:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:18:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-02-06 05:18:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:18:03,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:03,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:03,678 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:03,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:03,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:03,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash 373280483, now seen corresponding path program 1 times [2025-02-06 05:18:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:03,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623380178] [2025-02-06 05:18:03,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:03,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:18:03,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:18:03,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:03,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 05:18:04,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623380178] [2025-02-06 05:18:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623380178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397904456] [2025-02-06 05:18:04,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:04,100 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,101 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,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:18:04,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:18:04,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:04,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:04,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 05:18:04,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:18:04,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:18:04,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:04,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:04,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:04,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-02-06 05:18:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:04,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:04,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 05:18:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 05:18:05,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397904456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:05,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:05,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-02-06 05:18:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734355425] [2025-02-06 05:18:05,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:05,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 05:18:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:05,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 05:18:05,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:18:05,247 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:18:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:05,922 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2025-02-06 05:18:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 05:18:05,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-02-06 05:18:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:05,923 INFO L225 Difference]: With dead ends: 194 [2025-02-06 05:18:05,923 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 05:18:05,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-06 05:18:05,924 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:05,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 535 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:18:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 05:18:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-02-06 05:18:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.302325581395349) internal successors, (112), 88 states have internal predecessors, (112), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 05:18:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2025-02-06 05:18:05,935 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 70 [2025-02-06 05:18:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:05,935 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2025-02-06 05:18:05,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:18:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2025-02-06 05:18:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:18:05,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:05,936 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:05,945 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:06,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:06,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:06,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash -797035772, now seen corresponding path program 1 times [2025-02-06 05:18:06,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:06,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701801082] [2025-02-06 05:18:06,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:18:06,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:18:06,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:06,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:18:06,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701801082] [2025-02-06 05:18:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701801082] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116739599] [2025-02-06 05:18:06,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:06,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:06,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:06,581 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,589 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,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:18:06,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:18:06,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:06,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:06,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 05:18:06,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:06,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:06,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-06 05:18:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 05:18:07,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:07,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116739599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:07,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:07,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-02-06 05:18:07,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441426645] [2025-02-06 05:18:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 05:18:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:07,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 05:18:07,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-06 05:18:07,305 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:18:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:07,669 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2025-02-06 05:18:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 05:18:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-02-06 05:18:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:07,671 INFO L225 Difference]: With dead ends: 202 [2025-02-06 05:18:07,671 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 05:18:07,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-02-06 05:18:07,673 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:07,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 398 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:18:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 05:18:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2025-02-06 05:18:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 90 states have internal predecessors, (114), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 05:18:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 160 transitions. [2025-02-06 05:18:07,684 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 160 transitions. Word has length 70 [2025-02-06 05:18:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:07,684 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 160 transitions. [2025-02-06 05:18:07,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:18:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2025-02-06 05:18:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:18:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:07,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:07,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 05:18:07,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:07,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash -189525275, now seen corresponding path program 1 times [2025-02-06 05:18:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789526677] [2025-02-06 05:18:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:18:07,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:18:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:18:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:07,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789526677] [2025-02-06 05:18:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789526677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:07,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855876075] [2025-02-06 05:18:07,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:07,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:07,972 INFO L229 MonitoredProcess]: Starting monitored process 7 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:07,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 05:18:08,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:18:08,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:18:08,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:08,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:08,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 05:18:08,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 05:18:08,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:08,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855876075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:08,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:08,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-02-06 05:18:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77262945] [2025-02-06 05:18:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:08,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:18:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:08,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:18:08,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:18:08,132 INFO L87 Difference]: Start difference. First operand 122 states and 160 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:08,230 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2025-02-06 05:18:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:18:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-02-06 05:18:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:08,231 INFO L225 Difference]: With dead ends: 260 [2025-02-06 05:18:08,231 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 05:18:08,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 05:18:08,232 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 96 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:08,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 277 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:18:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 05:18:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 05:18:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 119 states have internal predecessors, (153), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-02-06 05:18:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2025-02-06 05:18:08,244 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 70 [2025-02-06 05:18:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:08,244 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2025-02-06 05:18:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2025-02-06 05:18:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 05:18:08,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:08,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:08,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 05:18:08,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 05:18:08,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:08,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1002041002, now seen corresponding path program 1 times [2025-02-06 05:18:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303407285] [2025-02-06 05:18:08,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:08,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 05:18:08,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 05:18:08,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:08,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:18:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:08,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303407285] [2025-02-06 05:18:08,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303407285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:08,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311970881] [2025-02-06 05:18:08,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:08,528 INFO L229 MonitoredProcess]: Starting monitored process 8 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:08,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 05:18:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 05:18:08,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 05:18:08,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 05:18:08,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 05:18:08,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311970881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:08,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:08,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-02-06 05:18:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929168677] [2025-02-06 05:18:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:08,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:18:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:08,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:18:08,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 05:18:08,699 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:08,835 INFO L93 Difference]: Finished difference Result 317 states and 433 transitions. [2025-02-06 05:18:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:18:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-02-06 05:18:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:08,836 INFO L225 Difference]: With dead ends: 317 [2025-02-06 05:18:08,837 INFO L226 Difference]: Without dead ends: 179 [2025-02-06 05:18:08,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:18:08,838 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:08,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 254 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:18:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-06 05:18:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2025-02-06 05:18:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 119 states have internal predecessors, (153), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-02-06 05:18:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2025-02-06 05:18:08,851 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 71 [2025-02-06 05:18:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:08,851 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2025-02-06 05:18:08,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2025-02-06 05:18:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 05:18:08,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:08,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:08,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 05:18:09,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:09,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:09,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2011864026, now seen corresponding path program 1 times [2025-02-06 05:18:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065878448] [2025-02-06 05:18:09,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:09,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 05:18:09,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 05:18:09,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:09,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 05:18:09,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:09,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065878448] [2025-02-06 05:18:09,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065878448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:09,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142361681] [2025-02-06 05:18:09,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:09,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:09,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:09,256 INFO L229 MonitoredProcess]: Starting monitored process 9 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:09,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 05:18:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 05:18:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 05:18:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:09,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 05:18:09,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:09,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:18:09,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:18:09,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 05:18:09,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-02-06 05:18:09,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-06 05:18:09,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 05:18:09,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,561 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 42 treesize of output 52 [2025-02-06 05:18:09,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 05:18:09,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:09,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 35 [2025-02-06 05:18:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 1 refuted. 12 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:18:12,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:13,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:13,395 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 1 case distinctions, treesize of input 92 treesize of output 96 [2025-02-06 05:18:13,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:13,415 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 1 case distinctions, treesize of input 89 treesize of output 90 [2025-02-06 05:18:13,442 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 6 treesize of output 4 [2025-02-06 05:18:13,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_arrayElimArr_6))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_5 v_subst_2))) (forall ((v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_588 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_583)))) (store (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_ArrVal_588) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_arrayElimArr_5) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_586))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2025-02-06 05:18:13,478 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:13,479 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:13,558 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:18:13,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 177 treesize of output 206 [2025-02-06 05:18:13,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:13,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 226 [2025-02-06 05:18:13,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:13,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 194 [2025-02-06 05:18:13,595 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 183 treesize of output 179 [2025-02-06 05:18:13,603 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:13,604 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:13,662 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:18:13,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 280 [2025-02-06 05:18:13,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:13,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 314 [2025-02-06 05:18:13,691 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 267 treesize of output 255 [2025-02-06 05:18:14,016 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 8 treesize of output 4 [2025-02-06 05:18:14,032 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 8 treesize of output 4 [2025-02-06 05:18:14,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:14,152 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:14,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:14,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 116 [2025-02-06 05:18:14,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:14,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-02-06 05:18:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-02-06 05:18:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142361681] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:18:14,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:18:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2025-02-06 05:18:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147837210] [2025-02-06 05:18:14,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 05:18:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:14,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 05:18:14,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=536, Unknown=40, NotChecked=48, Total=702 [2025-02-06 05:18:14,311 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 27 states, 23 states have (on average 4.217391304347826) internal successors, (97), 23 states have internal predecessors, (97), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-02-06 05:18:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:20,369 INFO L93 Difference]: Finished difference Result 351 states and 475 transitions. [2025-02-06 05:18:20,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 05:18:20,369 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.217391304347826) internal successors, (97), 23 states have internal predecessors, (97), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 71 [2025-02-06 05:18:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:20,371 INFO L225 Difference]: With dead ends: 351 [2025-02-06 05:18:20,371 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 05:18:20,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=218, Invalid=1668, Unknown=98, NotChecked=86, Total=2070 [2025-02-06 05:18:20,372 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 23 mSolverCounterUnsat, 258 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 258 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:20,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1698 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 984 Invalid, 258 Unknown, 162 Unchecked, 3.7s Time] [2025-02-06 05:18:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 05:18:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 211. [2025-02-06 05:18:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 170 states have internal predecessors, (223), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2025-02-06 05:18:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2025-02-06 05:18:20,401 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 71 [2025-02-06 05:18:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:20,402 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2025-02-06 05:18:20,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.217391304347826) internal successors, (97), 23 states have internal predecessors, (97), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-02-06 05:18:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2025-02-06 05:18:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 05:18:20,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:20,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:20,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 05:18:20,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:20,607 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:20,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2138953986, now seen corresponding path program 1 times [2025-02-06 05:18:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:20,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064964697] [2025-02-06 05:18:20,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:20,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 05:18:20,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 05:18:20,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:20,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:18:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064964697] [2025-02-06 05:18:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064964697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089773402] [2025-02-06 05:18:20,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:20,702 INFO L229 MonitoredProcess]: Starting monitored process 10 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:20,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 05:18:20,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 05:18:20,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 05:18:20,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:20,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:20,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 05:18:20,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 05:18:20,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089773402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-02-06 05:18:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557715040] [2025-02-06 05:18:20,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:20,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:18:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:20,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:18:20,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:18:20,895 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:21,074 INFO L93 Difference]: Finished difference Result 459 states and 616 transitions. [2025-02-06 05:18:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:18:21,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-06 05:18:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:21,076 INFO L225 Difference]: With dead ends: 459 [2025-02-06 05:18:21,076 INFO L226 Difference]: Without dead ends: 284 [2025-02-06 05:18:21,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-02-06 05:18:21,077 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:21,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 297 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:18:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-06 05:18:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2025-02-06 05:18:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 169 states have (on average 1.349112426035503) internal successors, (228), 173 states have internal predecessors, (228), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2025-02-06 05:18:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2025-02-06 05:18:21,103 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 73 [2025-02-06 05:18:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:21,104 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2025-02-06 05:18:21,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2025-02-06 05:18:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 05:18:21,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:21,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:21,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:21,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:21,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:21,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1850041836, now seen corresponding path program 1 times [2025-02-06 05:18:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:21,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126238282] [2025-02-06 05:18:21,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:21,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:18:21,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:18:21,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:21,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:18:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126238282] [2025-02-06 05:18:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126238282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283939522] [2025-02-06 05:18:21,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:21,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:21,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:21,435 INFO L229 MonitoredProcess]: Starting monitored process 11 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:21,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 05:18:21,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:18:21,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:18:21,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:21,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:21,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 05:18:21,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 05:18:21,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283939522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:21,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-06 05:18:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858277243] [2025-02-06 05:18:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:21,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:18:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:21,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:18:21,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:18:21,570 INFO L87 Difference]: Start difference. First operand 214 states and 285 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:21,599 INFO L93 Difference]: Finished difference Result 418 states and 579 transitions. [2025-02-06 05:18:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:18:21,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-02-06 05:18:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:21,601 INFO L225 Difference]: With dead ends: 418 [2025-02-06 05:18:21,601 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 05:18:21,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:18:21,602 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:21,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 05:18:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 223. [2025-02-06 05:18:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.348314606741573) internal successors, (240), 182 states have internal predecessors, (240), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2025-02-06 05:18:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2025-02-06 05:18:21,619 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 74 [2025-02-06 05:18:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:21,619 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2025-02-06 05:18:21,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:18:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2025-02-06 05:18:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 05:18:21,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:21,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:21,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 05:18:21,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 05:18:21,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:21,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash -167275381, now seen corresponding path program 1 times [2025-02-06 05:18:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495327747] [2025-02-06 05:18:21,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:21,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:18:21,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:18:21,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:21,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 05:18:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495327747] [2025-02-06 05:18:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495327747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798712797] [2025-02-06 05:18:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:21,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:21,907 INFO L229 MonitoredProcess]: Starting monitored process 12 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:21,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 05:18:22,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:18:22,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:18:22,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:22,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:22,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 05:18:22,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 05:18:22,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798712797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-02-06 05:18:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729568787] [2025-02-06 05:18:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:22,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:18:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:22,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:18:22,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 05:18:22,104 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:18:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:22,209 INFO L93 Difference]: Finished difference Result 393 states and 525 transitions. [2025-02-06 05:18:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:18:22,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 82 [2025-02-06 05:18:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:22,211 INFO L225 Difference]: With dead ends: 393 [2025-02-06 05:18:22,211 INFO L226 Difference]: Without dead ends: 187 [2025-02-06 05:18:22,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:18:22,212 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:22,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:18:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-06 05:18:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-06 05:18:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 148 states have internal predecessors, (185), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-02-06 05:18:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 238 transitions. [2025-02-06 05:18:22,226 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 238 transitions. Word has length 82 [2025-02-06 05:18:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:22,227 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 238 transitions. [2025-02-06 05:18:22,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:18:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 238 transitions. [2025-02-06 05:18:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 05:18:22,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:22,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:22,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 05:18:22,429 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -592860112, now seen corresponding path program 1 times [2025-02-06 05:18:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763927831] [2025-02-06 05:18:22,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:22,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:18:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:18:22,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:22,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 05:18:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763927831] [2025-02-06 05:18:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763927831] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003166798] [2025-02-06 05:18:22,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:22,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:22,673 INFO L229 MonitoredProcess]: Starting monitored process 13 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:22,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 05:18:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:18:22,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:18:22,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:22,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:22,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 05:18:22,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:22,876 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-06 05:18:22,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 05:18:22,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-02-06 05:18:22,888 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 54 treesize of output 53 [2025-02-06 05:18:22,947 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse2 (select .cse0 .cse3))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse2 v_arrayElimArr_10) .cse1) .cse3 .cse2)) (not (= .cse1 .cse2)) (not (= .cse2 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) is different from true [2025-02-06 05:18:23,222 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (let ((.cse1 (select .cse2 .cse3))) (let ((.cse0 (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| .cse1))) (or (and (not .cse0) (not (= 0 .cse1)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_11) .cse1 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3 .cse1))))) (and (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) .cse0 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse6 (select .cse4 .cse7))) (and (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse5 v_DerPreprocessor_11) .cse6 v_arrayElimArr_10) .cse5) .cse7 .cse6)) (not (= .cse5 .cse6)) (not (= .cse6 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:23,251 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:23,355 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (let ((.cse6 (select .cse7 .cse8))) (let ((.cse5 (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| .cse6))) (or (and (not .cse5) (not (= 0 .cse6)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_11) .cse6 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8 .cse6))))) (and (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse11 (select .cse9 .cse12))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_11) .cse11 v_arrayElimArr_10) .cse10) .cse12 .cse11)) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:23,397 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= .cse7 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| 0))) (and (not (= .cse7 0)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse8 .cse7) .cse6))) (not .cse5)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse11 (select .cse9 .cse12))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_11) .cse11 v_arrayElimArr_10) .cse10) .cse12 .cse11)) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:23,435 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse5 v_arrayElimArr_10) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse12 v_arrayElimArr_10) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:24,031 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= .cse7 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| 0))) (and (not (= .cse7 0)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse8 .cse7) .cse6))) (not .cse5)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse12))) (and (not (= .cse9 0)) (not (= .cse10 .cse9)) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_11) .cse9 v_arrayElimArr_10) .cse10) .cse12 .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse16 (select .cse14 .cse17))) (and (= .cse14 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_11) .cse16 v_arrayElimArr_10) .cse15) .cse17 .cse16)) (not (= .cse15 .cse16)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:24,070 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:24,267 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse13 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse12 (select .cse11 .cse13))) (let ((.cse10 (= .cse12 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (or (and .cse10 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| 0))) (and (not (= .cse12 0)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_11) .cse12 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse13 .cse12) .cse11))) (not .cse10)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse14 (select .cse16 .cse17))) (and (not (= .cse14 0)) (not (= .cse15 .cse14)) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_11) .cse14 v_arrayElimArr_10) .cse15) .cse17 .cse14))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse21 (select .cse19 .cse22))) (and (= .cse19 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse20 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse20) .cse22 .cse21)) (not (= .cse20 .cse21)) (not (= .cse21 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse23 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse23 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-02-06 05:18:24,417 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21))))))))) is different from true [2025-02-06 05:18:25,146 WARN L873 $PredicateComparison]: unable to prove that (and (or |c_aws_linked_list_is_valid_#t~short310#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21))))))))) is different from true [2025-02-06 05:18:25,219 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21)))))))) (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) is different from true [2025-02-06 05:18:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2025-02-06 05:18:25,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:29,770 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-02-06 05:18:29,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2025-02-06 05:18:29,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:29,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 119 [2025-02-06 05:18:29,788 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 68 treesize of output 64 [2025-02-06 05:18:29,823 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 6 treesize of output 4 [2025-02-06 05:18:29,835 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 6 treesize of output 4 [2025-02-06 05:18:29,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:29,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 05:18:29,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:29,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-02-06 05:18:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 05:18:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003166798] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:18:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 19] total 30 [2025-02-06 05:18:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128914083] [2025-02-06 05:18:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:18:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:29,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:18:29,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=247, Unknown=43, NotChecked=516, Total=870 [2025-02-06 05:18:29,879 INFO L87 Difference]: Start difference. First operand 187 states and 238 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:18:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:34,170 INFO L93 Difference]: Finished difference Result 330 states and 429 transitions. [2025-02-06 05:18:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:18:34,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2025-02-06 05:18:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:34,172 INFO L225 Difference]: With dead ends: 330 [2025-02-06 05:18:34,172 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 05:18:34,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=78, Invalid=344, Unknown=46, NotChecked=588, Total=1056 [2025-02-06 05:18:34,173 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:34,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 428 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:18:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 05:18:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2025-02-06 05:18:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 154 states have internal predecessors, (191), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-02-06 05:18:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 244 transitions. [2025-02-06 05:18:34,189 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 244 transitions. Word has length 83 [2025-02-06 05:18:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:34,190 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 244 transitions. [2025-02-06 05:18:34,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:18:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 244 transitions. [2025-02-06 05:18:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 05:18:34,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:34,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:34,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:34,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1916471952, now seen corresponding path program 1 times [2025-02-06 05:18:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497659573] [2025-02-06 05:18:34,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:34,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:18:34,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:18:34,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:34,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 05:18:34,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:34,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497659573] [2025-02-06 05:18:34,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497659573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:34,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518334075] [2025-02-06 05:18:34,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:34,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:34,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:34,667 INFO L229 MonitoredProcess]: Starting monitored process 14 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:34,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 05:18:34,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:18:34,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:18:34,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:34,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:34,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 05:18:34,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:34,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:18:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:18:34,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:34,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 05:18:34,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:34,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:34,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-02-06 05:18:34,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:34,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-06 05:18:34,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:34,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 05:18:34,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:34,990 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 42 treesize of output 52 [2025-02-06 05:18:34,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 05:18:35,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:35,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:35,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:35,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:35,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 35 [2025-02-06 05:18:35,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:35,026 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 54 treesize of output 35 [2025-02-06 05:18:35,028 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 11 treesize of output 3 [2025-02-06 05:18:35,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-02-06 05:18:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 05:18:36,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:37,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_994 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_994)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_995 Int) (v_ArrVal_998 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_995)) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-02-06 05:18:37,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:37,168 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 1 case distinctions, treesize of input 92 treesize of output 96 [2025-02-06 05:18:37,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:37,174 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 1 case distinctions, treesize of input 89 treesize of output 90 [2025-02-06 05:18:37,182 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 6 treesize of output 4 [2025-02-06 05:18:37,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_subst_3 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_16))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_subst_4 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_15 v_subst_4))) (forall ((v_ArrVal_995 Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_991 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_991)))) (store (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_ArrVal_998) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_15) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_995))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2025-02-06 05:18:37,229 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:37,230 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:37,290 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2025-02-06 05:18:37,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 290 [2025-02-06 05:18:37,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 226 [2025-02-06 05:18:37,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:37,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 194 [2025-02-06 05:18:37,325 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 183 treesize of output 179 [2025-02-06 05:18:37,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:37,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:37,397 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2025-02-06 05:18:37,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 280 [2025-02-06 05:18:37,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:37,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 314 [2025-02-06 05:18:37,422 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 267 treesize of output 255 [2025-02-06 05:18:37,794 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 8 treesize of output 4 [2025-02-06 05:18:38,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:38,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 74 [2025-02-06 05:18:38,055 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:38,056 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:38,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-06 05:18:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-02-06 05:18:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518334075] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:18:38,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:18:38,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2025-02-06 05:18:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238439430] [2025-02-06 05:18:38,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:38,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 05:18:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:38,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 05:18:38,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=484, Unknown=2, NotChecked=90, Total=650 [2025-02-06 05:18:38,094 INFO L87 Difference]: Start difference. First operand 193 states and 244 transitions. Second operand has 26 states, 23 states have (on average 5.304347826086956) internal successors, (122), 25 states have internal predecessors, (122), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2025-02-06 05:18:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:39,924 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2025-02-06 05:18:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 05:18:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.304347826086956) internal successors, (122), 25 states have internal predecessors, (122), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 83 [2025-02-06 05:18:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:39,926 INFO L225 Difference]: With dead ends: 443 [2025-02-06 05:18:39,926 INFO L226 Difference]: Without dead ends: 224 [2025-02-06 05:18:39,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=221, Invalid=1591, Unknown=2, NotChecked=166, Total=1980 [2025-02-06 05:18:39,927 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 83 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:39,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1319 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 989 Invalid, 0 Unknown, 321 Unchecked, 1.1s Time] [2025-02-06 05:18:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-06 05:18:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2025-02-06 05:18:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 166 states have internal predecessors, (201), 26 states have call successors, (26), 15 states have call predecessors, (26), 18 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2025-02-06 05:18:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2025-02-06 05:18:39,945 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 83 [2025-02-06 05:18:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:39,945 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2025-02-06 05:18:39,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.304347826086956) internal successors, (122), 25 states have internal predecessors, (122), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2025-02-06 05:18:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2025-02-06 05:18:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 05:18:39,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:39,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:39,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:40,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:40,147 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1113844778, now seen corresponding path program 1 times [2025-02-06 05:18:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:40,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137165743] [2025-02-06 05:18:40,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:40,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:40,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 05:18:40,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 05:18:40,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-06 05:18:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137165743] [2025-02-06 05:18:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137165743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245199460] [2025-02-06 05:18:40,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:40,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:40,367 INFO L229 MonitoredProcess]: Starting monitored process 15 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:40,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 05:18:40,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 05:18:40,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 05:18:40,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:40,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:40,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 05:18:40,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:40,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-06 05:18:40,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 05:18:40,623 INFO L349 Elim1Store]: treesize reduction 56, result has 8.2 percent of original size [2025-02-06 05:18:40,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 61 [2025-02-06 05:18:40,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-02-06 05:18:44,719 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse4 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse0) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse1 (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse2 .cse3 (select .cse1 .cse3))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse4 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse0 0))))))) is different from true [2025-02-06 05:18:45,048 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse4 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse0) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse1 (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse2 .cse3 (select .cse1 .cse3))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse4 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse0 0))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (= v_DerPreprocessor_13 .cse5) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (= .cse6 (let ((.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (store .cse7 .cse8 (select .cse6 .cse8))))) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select (select .cse9 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (<= (+ 2 .cse5) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (not (= .cse5 0)))))))) is different from true [2025-02-06 05:18:45,080 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= .cse0 v_DerPreprocessor_13) (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|) (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse7 (select .cse9 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse5 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse5 v_DerPreprocessor_16) (not (= .cse5 0)) (<= (+ .cse5 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse6 (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse7 .cse8 (select .cse6 .cse8))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse9 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|)))))))) is different from true [2025-02-06 05:18:45,198 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse4 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse0) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse1 (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse2 .cse3 (select .cse1 .cse3))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse4 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse0 0))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse7 (select .cse6 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse5 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= .cse5 v_DerPreprocessor_13) (<= (+ .cse5 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|) (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse6 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse7 .cse8 (select .cse9 .cse8))) .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse12 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse10 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse10 v_DerPreprocessor_16) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse11 (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse12 .cse13 (select .cse11 .cse13))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (= v_DerPreprocessor_13 .cse15) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (= .cse16 (let ((.cse18 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (store .cse17 .cse18 (select .cse16 .cse18))))) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (<= (+ 2 .cse15) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (not (= .cse15 0)))))))) is different from true [2025-02-06 05:18:45,434 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse0 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4)) (= v_DerPreprocessor_22 .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse7 (select .cse9 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse5 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse5 v_DerPreprocessor_16) (not (= .cse5 0)) (<= (+ .cse5 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse6 (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse7 .cse8 (select .cse6 .cse8))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse9 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_19 Int)) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse11 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse10 (select .cse11 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (not (= .cse10 0)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse11 .cse12 (select .cse13 .cse12))) .cse13)) (= v_DerPreprocessor_19 .cse10) (<= (+ 2 .cse10) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse18 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse15 (select .cse18 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse15) (= (select (select .cse16 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse15) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse17 (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse18 .cse19 (select .cse17 .cse19))))) (not (= .cse15 0)))))))) is different from true [2025-02-06 05:18:46,055 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse0 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4)) (= v_DerPreprocessor_22 .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (= (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (store .cse5 .cse6 (select .cse7 .cse6))) .cse7)) (= .cse8 v_DerPreprocessor_19) (= (select (select .cse9 .cse8) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (not (= .cse8 0)) (<= (+ .cse8 2) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse12 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse10 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse10 v_DerPreprocessor_16) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse11 (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse12 .cse13 (select .cse11 .cse13))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_19 Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse16 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse15 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (not (= .cse15 0)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse16 .cse17 (select .cse18 .cse17))) .cse18)) (= v_DerPreprocessor_19 .cse15) (<= (+ 2 .cse15) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse23 (select .cse21 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse20 (select .cse23 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse20) (= (select (select .cse21 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse20) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse22 (let ((.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse23 .cse24 (select .cse22 .cse24))))) (not (= .cse20 0)))))))) is different from true [2025-02-06 05:18:46,120 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_26) v_DerPreprocessor_27 v_DerPreprocessor_25))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (not (= .cse0 0)) (= (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= .cse0 v_DerPreprocessor_27) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse7 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse5 .cse6) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse7 .cse8 (select .cse9 .cse8))) .cse9)) (= v_DerPreprocessor_22 .cse6) (not (= .cse6 0)) (<= (+ 2 .cse6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse12 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse10 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse10 v_DerPreprocessor_16) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse11 (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse12 .cse13 (select .cse11 .cse13))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| Int) (v_DerPreprocessor_19 Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse16 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (let ((.cse18 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24|))) (and (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (= .cse15 (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| 24))) (store .cse16 .cse17 (select .cse15 .cse17))))) (not (= .cse18 0)) (= (select (select .cse19 .cse18) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 .cse18) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (= v_DerPreprocessor_19 .cse18)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse23 (select .cse21 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse20 (select .cse23 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse20) (= (select (select .cse21 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse20) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse22 (let ((.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse23 .cse24 (select .cse22 .cse24))))) (not (= .cse20 0)))))))) is different from true [2025-02-06 05:18:46,383 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_26) v_DerPreprocessor_27 v_DerPreprocessor_25))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (not (= .cse0 0)) (= (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= .cse0 v_DerPreprocessor_27) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse7 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse5 .cse6) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse7 .cse8 (select .cse9 .cse8))) .cse9)) (= v_DerPreprocessor_22 .cse6) (not (= .cse6 0)) (<= (+ 2 .cse6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int)) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (let ((.cse13 (select .cse10 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|))) (and (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (= (let ((.cse11 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (store .cse10 .cse11 (select .cse12 .cse11))) .cse12)) (= .cse13 v_DerPreprocessor_19) (= (select (select .cse14 .cse13) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (not (= .cse13 0)) (<= (+ .cse13 2) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse17 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse15 (select .cse17 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse15 v_DerPreprocessor_16) (not (= .cse15 0)) (<= (+ .cse15 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse16 (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse17 .cse18 (select .cse16 .cse18))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_19 Int)) (let ((.cse24 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse21 (select .cse24 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse20 (select .cse21 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (not (= .cse20 0)) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse21 .cse22 (select .cse23 .cse22))) .cse23)) (= v_DerPreprocessor_19 .cse20) (<= (+ 2 .cse20) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= (select (select .cse24 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| Int) (v_DerPreprocessor_19 Int)) (let ((.cse29 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse26 (select .cse29 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (let ((.cse28 (select .cse26 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24|))) (and (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (= .cse25 (let ((.cse27 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| 24))) (store .cse26 .cse27 (select .cse25 .cse27))))) (not (= .cse28 0)) (= (select (select .cse29 .cse28) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 .cse28) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (= v_DerPreprocessor_19 .cse28)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse33 (select .cse31 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse30 (select .cse33 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse30) (= (select (select .cse31 .cse30) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse30) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse32 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse32 (let ((.cse34 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse33 .cse34 (select .cse32 .cse34))))) (not (= .cse30 0)))))))) is different from true [2025-02-06 05:18:46,580 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_26) v_DerPreprocessor_27 v_DerPreprocessor_25))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (not (= .cse0 0)) (= (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= .cse0 v_DerPreprocessor_27) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_38| Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27| v_DerPreprocessor_32) v_DerPreprocessor_33 v_DerPreprocessor_31))) (let ((.cse8 (select .cse6 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|))) (let ((.cse5 (select .cse8 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_26|))) (and (not (= .cse5 0)) (= (select (select .cse6 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_38|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|) (<= (+ 2 .cse5) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|))) (= .cse7 (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_26| 24))) (store .cse8 .cse9 (select .cse7 .cse9))))) (= v_DerPreprocessor_33 .cse5)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse12 (select .cse10 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse11 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse10 .cse11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse12 .cse13 (select .cse14 .cse13))) .cse14)) (= v_DerPreprocessor_22 .cse11) (not (= .cse11 0)) (<= (+ 2 .cse11) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_25| Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_30 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_37| Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26| v_DerPreprocessor_29) v_DerPreprocessor_30 v_DerPreprocessor_28))) (let ((.cse17 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|))) (let ((.cse15 (select .cse17 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_25|))) (and (not (= .cse15 0)) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|))) (= .cse16 (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_25| 24))) (store .cse17 .cse18 (select .cse16 .cse18))))) (<= (+ .cse15 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|) (= v_DerPreprocessor_30 .cse15) (= (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_37|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse22 (select .cse24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse20 (select .cse22 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse20 v_DerPreprocessor_16) (not (= .cse20 0)) (<= (+ .cse20 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse21 (let ((.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse22 .cse23 (select .cse21 .cse23))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse24 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| Int) (v_DerPreprocessor_19 Int)) (let ((.cse29 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse26 (select .cse29 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (let ((.cse28 (select .cse26 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24|))) (and (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (= .cse25 (let ((.cse27 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| 24))) (store .cse26 .cse27 (select .cse25 .cse27))))) (not (= .cse28 0)) (= (select (select .cse29 .cse28) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 .cse28) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (= v_DerPreprocessor_19 .cse28)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse33 (select .cse31 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse30 (select .cse33 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse30) (= (select (select .cse31 .cse30) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse30) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse32 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse32 (let ((.cse34 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse33 .cse34 (select .cse32 .cse34))))) (not (= .cse30 0)))))))) is different from true [2025-02-06 05:18:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 38 not checked. [2025-02-06 05:18:49,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:49,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:49,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2025-02-06 05:18:49,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:49,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 161 [2025-02-06 05:18:49,582 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 332 treesize of output 324 [2025-02-06 05:18:49,588 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 196 treesize of output 194 [2025-02-06 05:18:49,648 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 24 treesize of output 22 [2025-02-06 05:18:49,654 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 6 treesize of output 4 [2025-02-06 05:18:49,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:49,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 60 [2025-02-06 05:18:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:18:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245199460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:18:49,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:18:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 11] total 35 [2025-02-06 05:18:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349031857] [2025-02-06 05:18:49,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:49,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 05:18:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:49,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 05:18:49,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=569, Unknown=29, NotChecked=504, Total=1190 [2025-02-06 05:18:49,852 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand has 35 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 13 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2025-02-06 05:18:52,744 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse3 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse1 (select .cse3 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse1) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse2 (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse3 .cse4 (select .cse2 .cse4))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse5 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse1 0))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse8 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse8 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= .cse6 v_DerPreprocessor_13) (<= (+ .cse6 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|) (not (= .cse6 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse7 .cse6) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse8 .cse9 (select .cse10 .cse9))) .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse13 (select .cse15 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse11 (select .cse13 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse11 v_DerPreprocessor_16) (not (= .cse11 0)) (<= (+ .cse11 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse12 (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse13 .cse14 (select .cse12 .cse14))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse15 .cse11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (= v_DerPreprocessor_13 .cse16) (= .cse0 (let ((.cse18 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (store .cse17 .cse18 (select .cse0 .cse18)))) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select (select .cse19 .cse16) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (<= (+ 2 .cse16) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (not (= .cse16 0))))))))) is different from true [2025-02-06 05:18:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:55,224 INFO L93 Difference]: Finished difference Result 503 states and 669 transitions. [2025-02-06 05:18:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 05:18:55,224 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 13 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 85 [2025-02-06 05:18:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:55,230 INFO L225 Difference]: With dead ends: 503 [2025-02-06 05:18:55,230 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 05:18:55,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=228, Invalid=2057, Unknown=107, NotChecked=1030, Total=3422 [2025-02-06 05:18:55,232 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 88 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 30 mSolverCounterUnsat, 191 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 191 IncrementalHoareTripleChecker+Unknown, 2400 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:55,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1192 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1296 Invalid, 191 Unknown, 2400 Unchecked, 3.0s Time] [2025-02-06 05:18:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 05:18:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2025-02-06 05:18:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 206 states have (on average 1.1990291262135921) internal successors, (247), 213 states have internal predecessors, (247), 42 states have call successors, (42), 18 states have call predecessors, (42), 22 states have return successors, (51), 39 states have call predecessors, (51), 40 states have call successors, (51) [2025-02-06 05:18:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 340 transitions. [2025-02-06 05:18:55,302 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 340 transitions. Word has length 85 [2025-02-06 05:18:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 340 transitions. [2025-02-06 05:18:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 13 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2025-02-06 05:18:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 340 transitions. [2025-02-06 05:18:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 05:18:55,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:55,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:55,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:55,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 05:18:55,504 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:55,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1484919617, now seen corresponding path program 1 times [2025-02-06 05:18:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:55,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8372565] [2025-02-06 05:18:55,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 05:18:55,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 05:18:55,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:55,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-06 05:18:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8372565] [2025-02-06 05:18:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8372565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161217609] [2025-02-06 05:18:55,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:55,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:55,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:55,629 INFO L229 MonitoredProcess]: Starting monitored process 16 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:55,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 05:18:55,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 05:18:55,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 05:18:55,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:55,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:55,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 05:18:55,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 05:18:55,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161217609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-02-06 05:18:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88980433] [2025-02-06 05:18:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:55,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:18:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:55,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:18:55,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:18:55,948 INFO L87 Difference]: Start difference. First operand 271 states and 340 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:18:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:56,141 INFO L93 Difference]: Finished difference Result 428 states and 537 transitions. [2025-02-06 05:18:56,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:18:56,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2025-02-06 05:18:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:56,143 INFO L225 Difference]: With dead ends: 428 [2025-02-06 05:18:56,143 INFO L226 Difference]: Without dead ends: 277 [2025-02-06 05:18:56,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-06 05:18:56,144 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:56,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 304 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:18:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-06 05:18:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2025-02-06 05:18:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 202 states have (on average 1.188118811881188) internal successors, (240), 207 states have internal predecessors, (240), 42 states have call successors, (42), 18 states have call predecessors, (42), 20 states have return successors, (47), 39 states have call predecessors, (47), 40 states have call successors, (47) [2025-02-06 05:18:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2025-02-06 05:18:56,178 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 87 [2025-02-06 05:18:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:56,179 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2025-02-06 05:18:56,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:18:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2025-02-06 05:18:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 05:18:56,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:56,182 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:56,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 05:18:56,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 05:18:56,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:56,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:56,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1942251993, now seen corresponding path program 1 times [2025-02-06 05:18:56,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:56,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743964091] [2025-02-06 05:18:56,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:56,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:56,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 05:18:56,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 05:18:56,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:56,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-06 05:18:56,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:56,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743964091] [2025-02-06 05:18:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743964091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:56,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858482279] [2025-02-06 05:18:56,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:56,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:56,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:56,765 INFO L229 MonitoredProcess]: Starting monitored process 17 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:56,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 05:18:56,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 05:18:56,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 05:18:56,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:56,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 05:18:56,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 05:18:56,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858482279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:56,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-02-06 05:18:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41449000] [2025-02-06 05:18:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:18:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:56,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:18:56,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:18:56,990 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 05:18:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:57,053 INFO L93 Difference]: Finished difference Result 402 states and 508 transitions. [2025-02-06 05:18:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:18:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 109 [2025-02-06 05:18:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:57,055 INFO L225 Difference]: With dead ends: 402 [2025-02-06 05:18:57,055 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 05:18:57,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:18:57,056 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:57,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 05:18:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2025-02-06 05:18:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 202 states have (on average 1.1782178217821782) internal successors, (238), 207 states have internal predecessors, (238), 42 states have call successors, (42), 18 states have call predecessors, (42), 20 states have return successors, (46), 39 states have call predecessors, (46), 40 states have call successors, (46) [2025-02-06 05:18:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 326 transitions. [2025-02-06 05:18:57,085 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 326 transitions. Word has length 109 [2025-02-06 05:18:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:57,086 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 326 transitions. [2025-02-06 05:18:57,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 05:18:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 326 transitions. [2025-02-06 05:18:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 05:18:57,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:57,087 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:18:57,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 05:18:57,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:57,292 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:57,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash -748756151, now seen corresponding path program 2 times [2025-02-06 05:18:57,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:57,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608961863] [2025-02-06 05:18:57,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:18:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:57,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-02-06 05:18:57,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 05:18:57,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:18:57,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 05:18:58,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608961863] [2025-02-06 05:18:58,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608961863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387494519] [2025-02-06 05:18:58,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:18:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:58,993 INFO L229 MonitoredProcess]: Starting monitored process 18 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:58,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 05:18:59,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-02-06 05:18:59,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 05:18:59,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:18:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:59,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-06 05:18:59,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:59,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-02-06 05:18:59,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-02-06 05:19:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 05:19:00,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:19:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387494519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:19:00,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:19:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19] total 31 [2025-02-06 05:19:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012414627] [2025-02-06 05:19:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:19:00,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 05:19:00,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:19:00,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 05:19:00,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2025-02-06 05:19:00,780 INFO L87 Difference]: Start difference. First operand 265 states and 326 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 05:19:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:19:02,061 INFO L93 Difference]: Finished difference Result 325 states and 397 transitions. [2025-02-06 05:19:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 05:19:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 112 [2025-02-06 05:19:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:19:02,063 INFO L225 Difference]: With dead ends: 325 [2025-02-06 05:19:02,063 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 05:19:02,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 05:19:02,064 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 36 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:19:02,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 739 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 05:19:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 05:19:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2025-02-06 05:19:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 205 states have (on average 1.175609756097561) internal successors, (241), 210 states have internal predecessors, (241), 42 states have call successors, (42), 18 states have call predecessors, (42), 21 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2025-02-06 05:19:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 331 transitions. [2025-02-06 05:19:02,111 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 331 transitions. Word has length 112 [2025-02-06 05:19:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:19:02,111 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 331 transitions. [2025-02-06 05:19:02,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 05:19:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 331 transitions. [2025-02-06 05:19:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 05:19:02,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:19:02,113 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:19:02,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-06 05:19:02,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 05:19:02,313 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:19:02,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:19:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -619673432, now seen corresponding path program 1 times [2025-02-06 05:19:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:19:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287845834] [2025-02-06 05:19:02,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:19:02,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 05:19:02,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 05:19:02,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:02,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 05:19:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:19:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287845834] [2025-02-06 05:19:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287845834] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:19:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201804314] [2025-02-06 05:19:02,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:02,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:02,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:19:02,873 INFO L229 MonitoredProcess]: Starting monitored process 19 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:19:02,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 05:19:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 05:19:03,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 05:19:03,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:03,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:03,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 05:19:03,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:19:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 05:19:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 05:19:03,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:19:04,381 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 56 treesize of output 52 [2025-02-06 05:19:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 53 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:19:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201804314] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:19:04,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:19:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 44 [2025-02-06 05:19:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552063967] [2025-02-06 05:19:04,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:19:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 05:19:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:19:04,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 05:19:04,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 05:19:04,427 INFO L87 Difference]: Start difference. First operand 269 states and 331 transitions. Second operand has 44 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 43 states have internal predecessors, (146), 17 states have call successors, (26), 3 states have call predecessors, (26), 9 states have return successors, (26), 14 states have call predecessors, (26), 16 states have call successors, (26) [2025-02-06 05:19:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:19:08,262 INFO L93 Difference]: Finished difference Result 1640 states and 2459 transitions. [2025-02-06 05:19:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-02-06 05:19:08,263 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 43 states have internal predecessors, (146), 17 states have call successors, (26), 3 states have call predecessors, (26), 9 states have return successors, (26), 14 states have call predecessors, (26), 16 states have call successors, (26) Word has length 112 [2025-02-06 05:19:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:19:08,268 INFO L225 Difference]: With dead ends: 1640 [2025-02-06 05:19:08,268 INFO L226 Difference]: Without dead ends: 1226 [2025-02-06 05:19:08,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1323, Invalid=10449, Unknown=0, NotChecked=0, Total=11772 [2025-02-06 05:19:08,273 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 551 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:19:08,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1882 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 05:19:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-02-06 05:19:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 848. [2025-02-06 05:19:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 652 states have (on average 1.24079754601227) internal successors, (809), 658 states have internal predecessors, (809), 135 states have call successors, (135), 36 states have call predecessors, (135), 60 states have return successors, (230), 153 states have call predecessors, (230), 131 states have call successors, (230) [2025-02-06 05:19:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1174 transitions. [2025-02-06 05:19:08,386 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1174 transitions. Word has length 112 [2025-02-06 05:19:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:19:08,387 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1174 transitions. [2025-02-06 05:19:08,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 43 states have internal predecessors, (146), 17 states have call successors, (26), 3 states have call predecessors, (26), 9 states have return successors, (26), 14 states have call predecessors, (26), 16 states have call successors, (26) [2025-02-06 05:19:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1174 transitions. [2025-02-06 05:19:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 05:19:08,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:19:08,389 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:19:08,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-06 05:19:08,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 05:19:08,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:19:08,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:19:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1921360642, now seen corresponding path program 1 times [2025-02-06 05:19:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:19:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106752150] [2025-02-06 05:19:08,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:19:08,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 05:19:08,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 05:19:08,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:08,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat