./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_back_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 baad12004cda93802c22774fa87dd5ddbc51e76f7e3c81692100acfcfda43c3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:19:58,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:19:58,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:19:58,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:19:58,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:19:58,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:19:58,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:19:58,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:19:58,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:19:58,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:19:58,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:19:58,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:19:58,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:19:58,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:19:58,109 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:19:58,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:19:58,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:19:58,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:19:58,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:19:58,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:19:58,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:19:58,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:19:58,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:19:58,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:19:58,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:19:58,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:19:58,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:19:58,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:19:58,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:19:58,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:19:58,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:19:58,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:19:58,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:19:58,113 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 -> baad12004cda93802c22774fa87dd5ddbc51e76f7e3c81692100acfcfda43c3a [2025-01-09 17:19:58,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:19:58,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:19:58,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:19:58,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:19:58,408 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:19:58,410 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_back_harness.i [2025-01-09 17:19:59,673 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd000b355/2a5c8f0a392b428ca7360325d0ae336d/FLAGde48d714c [2025-01-09 17:20:00,314 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:20:00,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2025-01-09 17:20:00,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd000b355/2a5c8f0a392b428ca7360325d0ae336d/FLAGde48d714c [2025-01-09 17:20:00,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd000b355/2a5c8f0a392b428ca7360325d0ae336d [2025-01-09 17:20:00,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:20:00,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:20:00,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:00,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:20:00,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:20:00,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:00" (1/1) ... [2025-01-09 17:20:00,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:00, skipping insertion in model container [2025-01-09 17:20:00,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:00" (1/1) ... [2025-01-09 17:20:00,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:20:00,727 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_back_harness.i[4494,4507] [2025-01-09 17:20:00,735 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_back_harness.i[4554,4567] [2025-01-09 17:20:01,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,286 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,286 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,288 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,302 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,303 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,304 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,306 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,309 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,310 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,310 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,639 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_back_harness.i[150650,150663] [2025-01-09 17:20:01,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:01,655 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:20:01,666 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_back_harness.i[4494,4507] [2025-01-09 17:20:01,670 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_back_harness.i[4554,4567] [2025-01-09 17:20:01,711 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,712 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,712 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,712 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,713 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,730 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,731 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,731 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:01,838 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_back_harness.i[150650,150663] [2025-01-09 17:20:01,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:02,003 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:20:02,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02 WrapperNode [2025-01-09 17:20:02,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:02,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:02,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:20:02,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:20:02,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,112 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-01-09 17:20:02,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:02,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:20:02,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:20:02,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:20:02,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,155 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 20, 5]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-01-09 17:20:02,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:20:02,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:20:02,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:20:02,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:20:02,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (1/1) ... [2025-01-09 17:20:02,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:02,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:02,220 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-01-09 17:20:02,226 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-01-09 17:20:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2025-01-09 17:20:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2025-01-09 17:20:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:20:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:20:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:20:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:20:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:20:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:20:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:20:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:20:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:20:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:20:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:20:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:20:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-01-09 17:20:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-01-09 17:20:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:20:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:20:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:20:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:20:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:20:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:20:02,459 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:20:02,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:20:02,806 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-01-09 17:20:02,806 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:20:02,817 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:20:02,817 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:20:02,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:02 BoogieIcfgContainer [2025-01-09 17:20:02,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:20:02,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:20:02,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:20:02,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:20:02,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:00" (1/3) ... [2025-01-09 17:20:02,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f944c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:02, skipping insertion in model container [2025-01-09 17:20:02,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:02" (2/3) ... [2025-01-09 17:20:02,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f944c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:02, skipping insertion in model container [2025-01-09 17:20:02,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:02" (3/3) ... [2025-01-09 17:20:02,828 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2025-01-09 17:20:02,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:20:02,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_back_harness.i that has 9 procedures, 96 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 17:20:02,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:20:02,907 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;@4b2b5637, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:20:02,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:20:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 63 states have internal predecessors, (79), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 17:20:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:20:02,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:02,922 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:02,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:02,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1106047712, now seen corresponding path program 1 times [2025-01-09 17:20:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863207941] [2025-01-09 17:20:02,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:03,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:03,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:03,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863207941] [2025-01-09 17:20:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863207941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:03,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198942638] [2025-01-09 17:20:03,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:03,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:03,282 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-01-09 17:20:03,284 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-01-09 17:20:03,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:03,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:03,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:03,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:03,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:20:03,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:03,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198942638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:03,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:20:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52438307] [2025-01-09 17:20:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:03,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:20:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:03,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:20:03,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:03,573 INFO L87 Difference]: Start difference. First operand has 96 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 63 states have internal predecessors, (79), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:20:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:03,609 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2025-01-09 17:20:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:20:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-01-09 17:20:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:03,619 INFO L225 Difference]: With dead ends: 184 [2025-01-09 17:20:03,620 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 17:20:03,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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-01-09 17:20:03,630 INFO L435 NwaCegarLoop]: 125 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, 125 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-01-09 17:20:03,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 17:20:03,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 17:20:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 17:20:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2025-01-09 17:20:03,677 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 83 [2025-01-09 17:20:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-01-09 17:20:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:20:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2025-01-09 17:20:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:20:03,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:03,681 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:03,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:20:03,882 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-01-09 17:20:03,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:03,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1954031340, now seen corresponding path program 1 times [2025-01-09 17:20:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520730429] [2025-01-09 17:20:03,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:03,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:04,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:04,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:04,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 17:20:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520730429] [2025-01-09 17:20:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520730429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792973194] [2025-01-09 17:20:06,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:06,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:06,231 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-01-09 17:20:06,232 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-01-09 17:20:06,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:06,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 17:20:06,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:06,622 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 22 treesize of output 7 [2025-01-09 17:20:06,634 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 19 [2025-01-09 17:20:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 17:20:08,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:20:21,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 170 treesize of output 162 [2025-01-09 17:20:21,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:21,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:21,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:21,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 17:20:21,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-01-09 17:20:21,895 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:21,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-09 17:20:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 17:20:22,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792973194] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:22,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:20:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [11, 17] total 39 [2025-01-09 17:20:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764248539] [2025-01-09 17:20:22,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:22,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 17:20:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:22,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 17:20:22,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1354, Unknown=3, NotChecked=0, Total=1482 [2025-01-09 17:20:22,037 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 17:20:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:22,545 INFO L93 Difference]: Finished difference Result 164 states and 222 transitions. [2025-01-09 17:20:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:20:22,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 83 [2025-01-09 17:20:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:22,547 INFO L225 Difference]: With dead ends: 164 [2025-01-09 17:20:22,548 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 17:20:22,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=135, Invalid=1502, Unknown=3, NotChecked=0, Total=1640 [2025-01-09 17:20:22,550 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:22,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1215 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:20:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 17:20:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 17:20:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 60 states have internal predecessors, (74), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 17:20:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-01-09 17:20:22,564 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 83 [2025-01-09 17:20:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:22,565 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-01-09 17:20:22,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 17:20:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2025-01-09 17:20:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 17:20:22,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:22,566 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:22,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:22,767 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-01-09 17:20:22,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:22,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 700917711, now seen corresponding path program 1 times [2025-01-09 17:20:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503529876] [2025-01-09 17:20:22,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:22,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 17:20:22,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 17:20:22,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:22,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:20:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503529876] [2025-01-09 17:20:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503529876] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727037558] [2025-01-09 17:20:23,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:23,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:23,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:23,174 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-01-09 17:20:23,176 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-01-09 17:20:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 17:20:23,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 17:20:23,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:23,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:23,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 17:20:23,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 17:20:23,490 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-01-09 17:20:23,506 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-01-09 17:20:23,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 17:20:23,569 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 11 treesize of output 11 [2025-01-09 17:20:23,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:23,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:23,586 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-01-09 17:20:23,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:23,596 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-01-09 17:20:23,606 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-01-09 17:20:23,618 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 27 treesize of output 20 [2025-01-09 17:20:23,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:23,676 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 32 treesize of output 29 [2025-01-09 17:20:23,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:23,687 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 1 case distinctions, treesize of input 52 treesize of output 43 [2025-01-09 17:20:23,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-01-09 17:20:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 17:20:24,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:20:26,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:26,128 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 93 treesize of output 92 [2025-01-09 17:20:26,151 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 6 [2025-01-09 17:20:26,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:26,346 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:26,430 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-01-09 17:20:26,431 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 181 treesize of output 210 [2025-01-09 17:20:26,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:26,455 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 230 treesize of output 230 [2025-01-09 17:20:26,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:26,473 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:26,563 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-01-09 17:20:26,564 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 245 treesize of output 274 [2025-01-09 17:20:26,591 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 227 treesize of output 215 [2025-01-09 17:20:26,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:26,622 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 316 treesize of output 314 [2025-01-09 17:20:26,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:26,658 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 265 treesize of output 262 [2025-01-09 17:20:27,548 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-01-09 17:20:28,196 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 7 treesize of output 3 [2025-01-09 17:20:29,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:29,478 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 787 treesize of output 747 [2025-01-09 17:20:30,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:30,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 944 treesize of output 866 [2025-01-09 17:20:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727037558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:32,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:20:32,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2025-01-09 17:20:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034585858] [2025-01-09 17:20:32,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 17:20:32,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 17:20:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:32,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 17:20:32,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=568, Unknown=8, NotChecked=0, Total=650 [2025-01-09 17:20:32,633 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2025-01-09 17:20:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:34,410 INFO L93 Difference]: Finished difference Result 176 states and 234 transitions. [2025-01-09 17:20:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 17:20:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) Word has length 84 [2025-01-09 17:20:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:34,413 INFO L225 Difference]: With dead ends: 176 [2025-01-09 17:20:34,413 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 17:20:34,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 135 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=184, Invalid=1368, Unknown=8, NotChecked=0, Total=1560 [2025-01-09 17:20:34,415 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 127 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:34,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 870 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 17:20:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 17:20:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 17:20:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.234375) internal successors, (79), 66 states have internal predecessors, (79), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-01-09 17:20:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2025-01-09 17:20:34,437 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 84 [2025-01-09 17:20:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:34,437 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2025-01-09 17:20:34,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2025-01-09 17:20:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2025-01-09 17:20:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 17:20:34,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:34,438 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:34,446 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-01-09 17:20:34,639 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-01-09 17:20:34,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 578458633, now seen corresponding path program 1 times [2025-01-09 17:20:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268798638] [2025-01-09 17:20:34,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:34,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 17:20:34,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 17:20:34,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:34,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 17:20:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268798638] [2025-01-09 17:20:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268798638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037360156] [2025-01-09 17:20:34,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:34,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:34,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:34,838 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-01-09 17:20:34,841 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-01-09 17:20:34,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 17:20:35,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 17:20:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:35,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 17:20:35,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:20:35,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037360156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:35,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-01-09 17:20:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601815300] [2025-01-09 17:20:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:35,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:35,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:35,135 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 17:20:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:35,442 INFO L93 Difference]: Finished difference Result 181 states and 237 transitions. [2025-01-09 17:20:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2025-01-09 17:20:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:35,444 INFO L225 Difference]: With dead ends: 181 [2025-01-09 17:20:35,444 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 17:20:35,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-01-09 17:20:35,445 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 130 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:35,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 554 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:20:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 17:20:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-01-09 17:20:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-01-09 17:20:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2025-01-09 17:20:35,471 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 86 [2025-01-09 17:20:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:35,472 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2025-01-09 17:20:35,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 17:20:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2025-01-09 17:20:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 17:20:35,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:35,475 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:35,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:35,676 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-01-09 17:20:35,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:35,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1921509083, now seen corresponding path program 1 times [2025-01-09 17:20:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939955786] [2025-01-09 17:20:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:35,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 17:20:35,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 17:20:35,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:35,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 17:20:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939955786] [2025-01-09 17:20:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939955786] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793272636] [2025-01-09 17:20:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:35,912 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-01-09 17:20:35,914 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-01-09 17:20:36,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 17:20:36,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 17:20:36,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:36,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:36,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 17:20:36,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:20:36,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:36,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793272636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-01-09 17:20:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890367249] [2025-01-09 17:20:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:36,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:36,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:36,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:36,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-01-09 17:20:36,241 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 17:20:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:36,614 INFO L93 Difference]: Finished difference Result 187 states and 245 transitions. [2025-01-09 17:20:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2025-01-09 17:20:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:36,616 INFO L225 Difference]: With dead ends: 187 [2025-01-09 17:20:36,616 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 17:20:36,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-01-09 17:20:36,617 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 144 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:36,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 616 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:20:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 17:20:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2025-01-09 17:20:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-01-09 17:20:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2025-01-09 17:20:36,640 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 88 [2025-01-09 17:20:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2025-01-09 17:20:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 17:20:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2025-01-09 17:20:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 17:20:36,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:36,643 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:36,652 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-01-09 17:20:36,843 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-01-09 17:20:36,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1738040333, now seen corresponding path program 1 times [2025-01-09 17:20:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906766546] [2025-01-09 17:20:36,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:36,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 17:20:36,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 17:20:36,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:36,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 17:20:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906766546] [2025-01-09 17:20:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906766546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657179379] [2025-01-09 17:20:37,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:37,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:37,107 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-01-09 17:20:37,109 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-01-09 17:20:37,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 17:20:37,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 17:20:37,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:37,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 17:20:37,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 17:20:37,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657179379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:37,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:37,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 17:20:37,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131082230] [2025-01-09 17:20:37,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:37,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:20:37,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:37,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:20:37,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:37,307 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:20:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:37,339 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2025-01-09 17:20:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:20:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-01-09 17:20:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:37,342 INFO L225 Difference]: With dead ends: 182 [2025-01-09 17:20:37,345 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 17:20:37,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:37,346 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:37,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 227 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 17:20:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-01-09 17:20:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 68 states have internal predecessors, (80), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-01-09 17:20:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2025-01-09 17:20:37,370 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 89 [2025-01-09 17:20:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:37,370 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2025-01-09 17:20:37,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:20:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2025-01-09 17:20:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 17:20:37,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:37,372 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:37,381 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-01-09 17:20:37,575 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-01-09 17:20:37,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1400845615, now seen corresponding path program 1 times [2025-01-09 17:20:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151825501] [2025-01-09 17:20:37,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:37,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 17:20:37,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 17:20:37,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:37,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:20:37,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:37,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151825501] [2025-01-09 17:20:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151825501] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27596367] [2025-01-09 17:20:37,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:37,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:37,933 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-01-09 17:20:37,935 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-01-09 17:20:38,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 17:20:38,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 17:20:38,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:38,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:38,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 17:20:38,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:38,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 17:20:38,248 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 17:20:38,258 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 17:20:38,258 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 17:20:38,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 17:20:38,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 17:20:38,272 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 11 treesize of output 11 [2025-01-09 17:20:38,278 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-01-09 17:20:38,281 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 16 treesize of output 11 [2025-01-09 17:20:38,327 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-01-09 17:20:38,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 124 [2025-01-09 17:20:38,331 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 104 treesize of output 86 [2025-01-09 17:20:38,337 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 65 treesize of output 35 [2025-01-09 17:20:38,351 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 69 treesize of output 26 [2025-01-09 17:20:39,709 INFO L349 Elim1Store]: treesize reduction 52, result has 65.1 percent of original size [2025-01-09 17:20:39,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 119 [2025-01-09 17:20:45,418 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse0 (select .cse4 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse3 (select .cse4 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse0 0)) (exists ((v_arrayElimCell_45 Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse1 (select .cse2 (+ 8 v_arrayElimCell_45)))) (and (= .cse1 (select .cse2 (+ (- 16) v_arrayElimCell_45))) (not (= .cse1 .cse3)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse3)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse1)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse1)))))) (not (= 16 v_arrayElimCell_45)))) (= .cse0 .cse3) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse3)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse5 (select .cse9 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse8 (select .cse9 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse5 0)) (exists ((v_arrayElimCell_45 Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse6 (select .cse7 (+ 8 v_arrayElimCell_45)))) (and (= .cse6 (select .cse7 (+ (- 16) v_arrayElimCell_45))) (not (= .cse6 .cse8)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse8)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse6)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse6)))))) (not (= 16 v_arrayElimCell_45)))) (= .cse5 .cse8) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse8)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (v_arrayElimCell_45 Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse14 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse13 (select .cse14 (- 16))) (.cse12 (select .cse14 8)) (.cse10 (select .cse11 (+ 8 v_arrayElimCell_45)))) (and (= .cse10 (select .cse11 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse10)) (= .cse12 .cse13) (not (= .cse13 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse12)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse10)) (not (= .cse12 .cse10)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse15 (select .cse20 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse16 (select .cse20 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse15 0)) (= .cse15 .cse16) (exists ((v_arrayElimCell_45 Int)) (let ((.cse17 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse17 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse18 (select .cse19 .cse17))) (and (= .cse18 (select .cse19 (+ (- 16) v_arrayElimCell_45))) (not (= .cse18 .cse16)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse18)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse18))))))))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse16)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse26 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12)) (.cse23 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse22 (select .cse23 .cse26)) (.cse21 (select .cse25 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse24 (select .cse25 .cse26))) (and (not (= .cse21 0)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse22)) (= .cse22 (select .cse23 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (= .cse21 .cse24) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse25 0))))))) (not (= .cse26 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse27 (select .cse31 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse30 (select .cse31 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse27 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse28 (select .cse29 (+ 8 v_arrayElimCell_45)))) (and (= .cse28 (select .cse29 (+ (- 16) v_arrayElimCell_45))) (not (= .cse28 .cse30)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse30)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse28)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse28)))))) (= .cse27 .cse30) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse30)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse32 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (not (= .cse32 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse37 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse33 (select .cse37 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse36 (select .cse37 .cse32))) (and (not (= .cse33 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse34 (select .cse35 (+ 8 v_arrayElimCell_45)))) (and (= .cse34 (select .cse35 (+ (- 16) v_arrayElimCell_45))) (not (= .cse34 .cse36)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse36)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse34)))))) (= .cse33 .cse36) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse36))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse43 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)) (.cse42 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse38 (select .cse42 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse39 (select .cse42 .cse43))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (not (= .cse38 0)) (= .cse38 .cse39) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse39)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse41 (select .cse40 .cse43))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 (select .cse40 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse41)) (= .cse41 (select .cse40 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse42 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse42 0))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse50 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse44 (select .cse49 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse48 (select .cse49 .cse50))) (and (not (= .cse44 0)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse45 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse45 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse47 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse46 (select .cse47 .cse45))) (and (= .cse46 (select .cse47 (+ (- 16) v_arrayElimCell_45))) (not (= .cse46 .cse48)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse46))))))))) (= .cse44 .cse48) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse48)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (not (= .cse50 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse51 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (not (= .cse51 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse55 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12)) (.cse54 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse53 (select .cse54 .cse51)) (.cse52 (select .cse55 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse56 (select .cse55 .cse51))) (and (not (= .cse52 0)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse53)) (= .cse53 (select .cse54 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse55 24))) (= .cse52 .cse56) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse56))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse59 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse58 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse57 (select .cse58 .cse59))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse57)) (= .cse57 (select .cse58 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse62 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse60 (select .cse62 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse61 (select .cse62 .cse59))) (and (not (= .cse60 0)) (= .cse60 .cse61) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse61)))))) (not (= .cse59 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (v_arrayElimCell_45 Int)) (let ((.cse64 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse67 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse66 (select .cse67 (- 16))) (.cse65 (select .cse67 8)) (.cse63 (select .cse64 (+ 8 v_arrayElimCell_45)))) (and (= .cse63 (select .cse64 (+ (- 16) v_arrayElimCell_45))) (not (= 16 v_arrayElimCell_45)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse63)) (= .cse65 .cse66) (not (= .cse66 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse65)) (not (= .cse65 .cse63)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse73 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse72 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse68 (select .cse72 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse69 (select .cse72 .cse73))) (and (not (= .cse68 0)) (= .cse68 .cse69) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse69)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse71 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse70 (select .cse71 .cse73))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse70)) (= .cse70 (select .cse71 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse72 24))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 (select .cse71 24))))))))))) (not (= .cse73 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse78 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse74 (select .cse78 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse75 (select .cse78 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse74 0)) (= .cse74 .cse75) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse75)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse77 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse76 (select .cse77 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse76)) (not (= .cse76 .cse75)) (= .cse76 (select .cse77 (- 16))))))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (v_arrayElimCell_45 Int)) (let ((.cse80 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse83 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse82 (select .cse83 (- 16))) (.cse81 (select .cse83 8)) (.cse79 (select .cse80 (+ 8 v_arrayElimCell_45)))) (and (= .cse79 (select .cse80 (+ (- 16) v_arrayElimCell_45))) (not (= 16 v_arrayElimCell_45)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse79)) (= .cse81 .cse82) (not (= .cse82 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse81)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse79)) (not (= .cse81 .cse79)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse89 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse88 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse84 (select .cse88 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse87 (select .cse88 .cse89))) (and (not (= .cse84 0)) (exists ((v_arrayElimCell_45 Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse86 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse85 (select .cse86 (+ 8 v_arrayElimCell_45)))) (and (= .cse85 (select .cse86 (+ (- 16) v_arrayElimCell_45))) (not (= .cse85 .cse87)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse87)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse85)))))) (not (= 16 v_arrayElimCell_45)))) (= .cse84 .cse87) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse87)))))) (not (= .cse89 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse95 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse90 (select .cse95 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse91 (select .cse95 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse90 0)) (= .cse90 .cse91) (exists ((v_arrayElimCell_45 Int)) (let ((.cse92 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse92 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse94 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse93 (select .cse94 .cse92))) (and (= .cse93 (select .cse94 (+ (- 16) v_arrayElimCell_45))) (not (= .cse93 .cse91)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse93)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse93))))))))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse91)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (v_arrayElimCell_45 Int)) (let ((.cse97 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse100 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse99 (select .cse100 (- 16))) (.cse98 (select .cse100 8)) (.cse96 (select .cse97 (+ 8 v_arrayElimCell_45)))) (and (= .cse96 (select .cse97 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse96)) (= .cse98 .cse99) (not (= .cse99 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse98)) (not (= .cse98 .cse96)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse101 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (not (= .cse101 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse105 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12)) (.cse104 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse103 (select .cse104 .cse101)) (.cse102 (select .cse105 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse106 (select .cse105 .cse101))) (and (not (= .cse102 0)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse103)) (= .cse103 (select .cse104 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse105 24))) (= .cse102 .cse106) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse106)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse105 0)))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse111 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse107 (select .cse111 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse110 (select .cse111 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse107 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse109 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse108 (select .cse109 (+ 8 v_arrayElimCell_45)))) (and (= .cse108 (select .cse109 (+ (- 16) v_arrayElimCell_45))) (not (= .cse108 .cse110)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse110)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse108)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse108)))))) (= .cse107 .cse110) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse110)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse116 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse112 (select .cse116 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse113 (select .cse116 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)))) (and (not (= .cse112 0)) (= .cse112 .cse113) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse113)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse115 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse114 (select .cse115 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse114)) (not (= .cse114 .cse113)) (= .cse114 (select .cse115 (- 16))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse121 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)) (.cse120 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse117 (select .cse120 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse122 (select .cse120 .cse121))) (and (not (= .cse117 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse118 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse119 (select .cse118 .cse121))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 (select .cse118 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse119)) (= .cse119 (select .cse118 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse120 24))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 (select .cse118 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse120 0))))))) (= .cse117 .cse122) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse122)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse123 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24))) (and (not (= .cse123 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse128 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse124 (select .cse128 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse125 (select .cse128 .cse123))) (and (not (= .cse124 0)) (= .cse124 .cse125) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse127 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse126 (select .cse127 .cse123))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse126)) (= .cse126 (select .cse127 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse128 24))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 (select .cse127 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse128 0))))))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse125))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_12 Int)) (let ((.cse133 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_10 24)) (.cse132 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_12))) (let ((.cse129 (select .cse132 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (.cse134 (select .cse132 .cse133))) (and (not (= .cse129 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse130 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse131 (select .cse130 .cse133))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 (select .cse130 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse131)) (= .cse131 (select .cse130 v_aws_linked_list_back_~list.offset_BEFORE_CALL_10)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse132 0))))))) (= .cse129 .cse134) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_12 .cse134))))))))) is different from true [2025-01-09 17:20:54,177 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse5 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)) (.cse2 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse1 (select .cse2 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse0 (select .cse2 .cse5))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse0)) (not (= .cse1 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse3 (select .cse4 .cse5))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse2 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse3)) (= .cse3 (select .cse4 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 (select .cse4 0))))))) (= .cse1 .cse0))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse9 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse7 (select .cse8 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse6 (select .cse8 .cse9))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse6)) (not (= .cse7 0)) (= .cse7 .cse6))))) (not (= .cse9 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse10 (select .cse11 .cse9))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse10)) (= .cse10 (select .cse11 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11))))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse12 (select .cse13 (+ 8 v_arrayElimCell_45))) (.cse15 (select .cse16 (- 16))) (.cse14 (select .cse16 8))) (and (= .cse12 (select .cse13 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse14)) (not (= 16 v_arrayElimCell_45)) (not (= .cse14 .cse12)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse12)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse12)) (not (= .cse15 0)) (= .cse15 .cse14))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse21 (select .cse22 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse17 (select .cse22 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse17)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse18 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse18 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse19 (select .cse20 .cse18))) (and (= .cse19 (select .cse20 (+ (- 16) v_arrayElimCell_45))) (not (= .cse19 .cse17)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse19)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse19))))))))) (not (= .cse21 0)) (= .cse21 .cse17))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse28 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)) (.cse25 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse24 (select .cse25 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse23 (select .cse25 .cse28))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse23)) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (not (= .cse24 0)) (= .cse24 .cse23) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse26 (select .cse27 .cse28))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse25 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse26)) (= .cse26 (select .cse27 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 (select .cse27 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse25 24))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse29 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= .cse29 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse31 (select .cse32 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse30 (select .cse32 .cse29))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse30)) (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse34 (select .cse33 .cse29))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse32 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 (select .cse33 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse34)) (= .cse34 (select .cse33 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse32 24))))))) (= .cse31 .cse30)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse38 (select .cse39 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse35 (select .cse39 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse35)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse37 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse36 (select .cse37 (+ 8 v_arrayElimCell_45)))) (and (= .cse36 (select .cse37 (+ (- 16) v_arrayElimCell_45))) (not (= .cse36 .cse35)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse36)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse35)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse36)))))) (not (= .cse38 0)) (= .cse38 .cse35))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse41 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse40 (select .cse41 (+ 8 v_arrayElimCell_45))) (.cse43 (select .cse44 (- 16))) (.cse42 (select .cse44 8))) (and (= .cse40 (select .cse41 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse42)) (not (= .cse42 .cse40)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse40)) (not (= .cse43 0)) (= .cse43 .cse42))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse46 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse45 (select .cse46 (+ 8 v_arrayElimCell_45))) (.cse48 (select .cse49 (- 16))) (.cse47 (select .cse49 8))) (and (= .cse45 (select .cse46 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse47)) (not (= .cse47 .cse45)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse45)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse45)) (not (= .cse48 0)) (= .cse48 .cse47))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse51 (select .cse54 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse50 (select .cse54 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse50)) (not (= .cse51 0)) (= .cse51 .cse50) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse53 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse52 (select .cse53 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse52)) (not (= .cse52 .cse50)) (= .cse52 (select .cse53 (- 16))))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse60 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse59 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse56 (select .cse59 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse55 (select .cse59 .cse60))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse55)) (not (= .cse56 0)) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse58 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse57 (select .cse58 (+ 8 v_arrayElimCell_45)))) (and (= .cse57 (select .cse58 (+ (- 16) v_arrayElimCell_45))) (not (= .cse57 .cse55)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse57)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse55)))))))) (= .cse56 .cse55))))) (not (= .cse60 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse66 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse65 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse62 (select .cse65 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse61 (select .cse65 .cse66))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse61)) (not (= .cse62 0)) (= .cse62 .cse61) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse63 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse64 (select .cse63 .cse66))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 (select .cse63 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse64)) (= .cse64 (select .cse63 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse65 24))))))))))) (not (= .cse66 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse67 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (not (= .cse67 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse72 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse70 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse69 (select .cse70 .cse67)) (.cse71 (select .cse72 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse68 (select .cse72 .cse67))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse68)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse69)) (= .cse69 (select .cse70 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= .cse71 0)) (= .cse71 .cse68) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse72 24)))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse73 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (not (= .cse73 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse79 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse75 (select .cse79 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse74 (select .cse79 .cse73))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse74)) (not (= .cse75 0)) (= .cse75 .cse74) (exists ((v_arrayElimCell_45 Int)) (let ((.cse76 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse76 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse78 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse77 (select .cse78 .cse76))) (and (= .cse77 (select .cse78 (+ (- 16) v_arrayElimCell_45))) (not (= .cse77 .cse74)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse77)))))))))))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse84 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse81 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse80 (select .cse81 (+ 8 v_arrayElimCell_45))) (.cse83 (select .cse84 (- 16))) (.cse82 (select .cse84 8))) (and (= .cse80 (select .cse81 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse82)) (not (= 16 v_arrayElimCell_45)) (not (= .cse82 .cse80)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse80)) (not (= .cse83 0)) (= .cse83 .cse82))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse89 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse86 (select .cse89 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse85 (select .cse89 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse85)) (not (= .cse86 0)) (= .cse86 .cse85) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse88 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse87 (select .cse88 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse87)) (not (= .cse87 .cse85)) (= .cse87 (select .cse88 (- 16))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse94 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse91 (select .cse94 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse90 (select .cse94 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse90)) (not (= .cse91 0)) (= .cse91 .cse90) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse93 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse92 (select .cse93 (+ 8 v_arrayElimCell_45)))) (and (= .cse92 (select .cse93 (+ (- 16) v_arrayElimCell_45))) (not (= .cse92 .cse90)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse92)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse90)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse92)))))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse100 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse95 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse98 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse97 (select .cse98 .cse100)) (.cse99 (select .cse95 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse96 (select .cse95 .cse100))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse95 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse96)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse97)) (= .cse97 (select .cse98 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= .cse99 0)) (= .cse99 .cse96) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse95 24))))))) (not (= .cse100 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse106 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)) (.cse103 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse102 (select .cse103 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse101 (select .cse103 .cse106))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse101)) (not (= .cse102 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse104 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse105 (select .cse104 .cse106))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse103 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 (select .cse104 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse105)) (= .cse105 (select .cse104 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 (select .cse104 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse103 24))))))) (= .cse102 .cse101))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse111 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse110 (select .cse111 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse107 (select .cse111 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse107)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse109 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse108 (select .cse109 (+ 8 v_arrayElimCell_45)))) (and (= .cse108 (select .cse109 (+ (- 16) v_arrayElimCell_45))) (not (= .cse108 .cse107)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse108)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse107)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse108)))))) (not (= .cse110 0)) (= .cse110 .cse107))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse116 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse113 (select .cse116 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse112 (select .cse116 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse112)) (not (= .cse113 0)) (= .cse113 .cse112) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse115 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse114 (select .cse115 (+ 8 v_arrayElimCell_45)))) (and (= .cse114 (select .cse115 (+ (- 16) v_arrayElimCell_45))) (not (= .cse114 .cse112)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse114)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse112)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse114)))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse122 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse121 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse118 (select .cse121 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse117 (select .cse121 .cse122))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse117)) (not (= .cse118 0)) (= .cse118 .cse117) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse120 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse119 (select .cse120 (+ 8 v_arrayElimCell_45)))) (and (= .cse119 (select .cse120 (+ (- 16) v_arrayElimCell_45))) (not (= .cse119 .cse117)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse119)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse117)))))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (not (= .cse122 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int)) (let ((.cse128 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse123 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13)) (.cse126 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse125 (select .cse126 .cse128)) (.cse127 (select .cse123 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse124 (select .cse123 .cse128))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse123 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse124)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse125)) (= .cse125 (select .cse126 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (not (= .cse127 0)) (= .cse127 .cse124))))) (not (= .cse128 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_13 Int)) (let ((.cse134 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_13))) (let ((.cse133 (select .cse134 v_aws_linked_list_back_~list.offset_BEFORE_CALL_11)) (.cse129 (select .cse134 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_11 24)))) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse129)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse130 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse130 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse132 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse131 (select .cse132 .cse130))) (and (= .cse131 (select .cse132 (+ (- 16) v_arrayElimCell_45))) (not (= .cse131 .cse129)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse131)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_13 .cse131))))))))) (not (= .cse133 0)) (= .cse133 .cse129)))))) is different from true [2025-01-09 17:21:06,706 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse5 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse3 (select .cse4 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse2 (select .cse4 .cse5))) (and (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse0 (select .cse1 (+ 8 v_arrayElimCell_45)))) (and (= .cse0 (select .cse1 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse0)) (not (= .cse0 .cse2)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse2)))))))) (not (= .cse3 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse2)) (= .cse3 .cse2))))) (not (= .cse5 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse11 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)) (.cse8 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse6 (select .cse8 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse7 (select .cse8 .cse11))) (and (not (= .cse6 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse7)) (= .cse6 .cse7) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse10 (select .cse9 .cse11))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse8 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse8 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 (select .cse9 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse10)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 (select .cse9 24))) (= .cse10 (select .cse9 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse12 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (not (= .cse12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse13 (select .cse18 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse14 (select .cse18 .cse12))) (and (not (= .cse13 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse14)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse15 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse15 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse16 (select .cse17 .cse15))) (and (= .cse16 (select .cse17 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse16)) (not (= .cse16 .cse14))))))))) (= .cse13 .cse14)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse24 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse19 (select .cse21 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse20 (select .cse21 .cse24))) (and (not (= .cse19 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse20)) (= .cse19 .cse20) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse22 (select .cse23 .cse24))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse21 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse22)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 (select .cse23 24))) (= .cse22 (select .cse23 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))))))) (not (= .cse24 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse29 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse25 (select .cse29 (- 16))) (.cse27 (select .cse28 (+ 8 v_arrayElimCell_45))) (.cse26 (select .cse29 8))) (and (= .cse25 .cse26) (= .cse27 (select .cse28 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse27)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse26)) (not (= .cse25 0)) (not (= .cse27 .cse26)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse30 (select .cse34 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse31 (select .cse34 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse30 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse31)) (= .cse30 .cse31) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse32 (select .cse33 (+ 8 v_arrayElimCell_45)))) (and (= .cse32 (select .cse33 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse32)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse32)) (not (= .cse32 .cse31)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse31)))))))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse39 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse35 (select .cse39 (- 16))) (.cse37 (select .cse38 (+ 8 v_arrayElimCell_45))) (.cse36 (select .cse39 8))) (and (= .cse35 .cse36) (= .cse37 (select .cse38 (+ (- 16) v_arrayElimCell_45))) (not (= 16 v_arrayElimCell_45)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse37)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse36)) (not (= .cse35 0)) (not (= .cse37 .cse36)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse40 (select .cse44 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse41 (select .cse44 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse40 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse41)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse43 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse42 (select .cse43 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse42)) (= .cse42 (select .cse43 (- 16))) (not (= .cse42 .cse41)))))) (= .cse40 .cse41))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse45 (select .cse49 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse46 (select .cse49 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse45 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse46)) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse48 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse47 (select .cse48 (+ 8 v_arrayElimCell_45)))) (and (= .cse47 (select .cse48 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse47)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse47)) (not (= .cse47 .cse46)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse46)))))))) (= .cse45 .cse46))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse55 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse50 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse51 (select .cse50 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse52 (select .cse50 .cse55)) (.cse53 (select .cse54 .cse55))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse50 24))) (not (= .cse51 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse52)) (= .cse51 .cse52) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse53)) (= .cse53 (select .cse54 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))) (not (= .cse55 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse59 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)) (.cse56 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse60 (select .cse56 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse61 (select .cse56 .cse59))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse57 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse58 (select .cse57 .cse59))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse56 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 (select .cse57 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse58)) (= .cse58 (select .cse57 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))) (not (= .cse60 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse61)) (= .cse60 .cse61))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse66 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse62 (select .cse66 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse63 (select .cse66 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse62 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse63)) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse65 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse64 (select .cse65 (+ 8 v_arrayElimCell_45)))) (and (= .cse64 (select .cse65 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse64)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse64)) (not (= .cse64 .cse63)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse63)))))))) (= .cse62 .cse63))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse70 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse71 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse67 (select .cse71 (- 16))) (.cse69 (select .cse70 (+ 8 v_arrayElimCell_45))) (.cse68 (select .cse71 8))) (and (= .cse67 .cse68) (= .cse69 (select .cse70 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse69)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse69)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse68)) (not (= .cse67 0)) (not (= .cse69 .cse68)))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse76 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse72 (select .cse76 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse73 (select .cse76 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse72 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse73)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse75 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse74 (select .cse75 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse74)) (= .cse74 (select .cse75 (- 16))) (not (= .cse74 .cse73)))))) (= .cse72 .cse73))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse81 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse77 (select .cse81 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse78 (select .cse81 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse77 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse78)) (= .cse77 .cse78) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse80 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse79 (select .cse80 (+ 8 v_arrayElimCell_45)))) (and (= .cse79 (select .cse80 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse79)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse79)) (not (= .cse79 .cse78)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse78)))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse87 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse84 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse82 (select .cse84 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse83 (select .cse84 .cse87))) (and (not (= .cse82 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse83)) (= .cse82 .cse83) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse86 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse85 (select .cse86 .cse87))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse84 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse84 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse85)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 (select .cse86 24))) (= .cse85 (select .cse86 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))))))) (not (= .cse87 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse91 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse92 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse88 (select .cse92 (- 16))) (.cse90 (select .cse91 (+ 8 v_arrayElimCell_45))) (.cse89 (select .cse92 8))) (and (= .cse88 .cse89) (= .cse90 (select .cse91 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse90)) (not (= 16 v_arrayElimCell_45)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse90)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse89)) (not (= .cse88 0)) (not (= .cse90 .cse89)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse96 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse95 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse93 (select .cse95 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse94 (select .cse95 .cse96))) (and (not (= .cse93 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse94)) (= .cse93 .cse94))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse98 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse97 (select .cse98 .cse96))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse97)) (= .cse97 (select .cse98 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))) (not (= .cse96 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse104 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse99 (select .cse104 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse100 (select .cse104 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse99 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse100)) (= .cse99 .cse100) (exists ((v_arrayElimCell_45 Int)) (let ((.cse103 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse102 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse101 (select .cse102 .cse103))) (and (= .cse101 (select .cse102 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse101)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse101)) (not (= .cse101 .cse100)))))) (not (= .cse103 0))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse110 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse109 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse105 (select .cse109 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse106 (select .cse109 .cse110))) (and (not (= .cse105 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse106)) (= .cse105 .cse106) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse108 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse107 (select .cse108 (+ 8 v_arrayElimCell_45)))) (and (= .cse107 (select .cse108 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse107)) (not (= .cse107 .cse106)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse106)))))))))) (not (= .cse110 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int)) (let ((.cse116 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse111 (select .cse116 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse112 (select .cse116 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)))) (and (not (= .cse111 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse112)) (= .cse111 .cse112) (exists ((v_arrayElimCell_45 Int)) (let ((.cse115 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse114 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse113 (select .cse114 .cse115))) (and (= .cse113 (select .cse114 (+ (- 16) v_arrayElimCell_45))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse113)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse113)) (not (= .cse113 .cse112)))))) (not (= .cse115 0))))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse122 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse121 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse117 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse118 (select .cse117 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse119 (select .cse117 .cse122)) (.cse120 (select .cse121 .cse122))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse117 0))) (not (= .cse118 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse119)) (= .cse118 .cse119) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse120)) (= .cse120 (select .cse121 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))) (not (= .cse122 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse128 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24)) (.cse125 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse123 (select .cse125 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse124 (select .cse125 .cse128))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (not (= .cse123 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse124)) (= .cse123 .cse124) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse126 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse127 (select .cse126 .cse128))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse125 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse125 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 (select .cse126 0))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse127)) (= .cse127 (select .cse126 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 Int)) (let ((.cse129 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 24))) (and (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_12 0)) (not (= .cse129 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_14 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse134 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse130 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_14))) (let ((.cse131 (select .cse130 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)) (.cse132 (select .cse130 .cse129)) (.cse133 (select .cse134 .cse129))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse130 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse130 0))) (not (= .cse131 0)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_14 .cse132)) (= .cse131 .cse132) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse133)) (= .cse133 (select .cse134 v_aws_linked_list_back_~list.offset_BEFORE_CALL_12)))))))))) is different from true [2025-01-09 17:21:16,359 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse0 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse0 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse1 (select .cse4 .cse0)) (.cse3 (select .cse5 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse2 (select .cse5 .cse0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse1)) (= .cse2 .cse3) (= .cse1 (select .cse4 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= .cse3 0)) (not (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (not (= (select .cse5 0) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse7 (select .cse10 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse6 (select .cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse6 .cse7) (not (= .cse7 0)) (not (= .cse6 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse8 (select .cse9 (+ 8 v_arrayElimCell_45)))) (and (= .cse8 (select .cse9 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse8)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse8)) (not (= .cse6 .cse8)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse16 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse12 (select .cse15 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse11 (select .cse15 .cse16))) (and (= .cse11 .cse12) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse13 (select .cse14 (+ 8 v_arrayElimCell_45)))) (and (= .cse13 (select .cse14 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse13)) (not (= .cse11 .cse13)) (not (= .cse11 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= .cse12 0)) (not (= .cse11 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (not (= .cse16 0)) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse18 (select .cse22 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse17 (select .cse22 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse17 .cse18) (not (= .cse18 0)) (not (= .cse17 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse19 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse19 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse20 (select .cse21 .cse19))) (and (= .cse20 (select .cse21 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse20)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse20)) (not (= .cse17 .cse20))))))))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse24 (select .cse27 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse23 (select .cse27 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse23 .cse24) (not (= .cse24 0)) (not (= .cse23 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse25 (select .cse26 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse25)) (= .cse25 (select .cse26 (- 16))) (not (= .cse23 .cse25)))))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse33 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)) (.cse32 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse29 (select .cse32 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse28 (select .cse32 .cse33))) (and (= .cse28 .cse29) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse30 (select .cse31 .cse33))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse30)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 (select .cse31 0))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 (select .cse31 24))) (= .cse30 (select .cse31 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse32 24))) (not (= (select .cse32 0) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= .cse29 0)) (not (= .cse28 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse35 (select .cse38 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse34 (select .cse38 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse34 .cse35) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse37 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse36 (select .cse37 (+ 8 v_arrayElimCell_45)))) (and (= .cse36 (select .cse37 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse36)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse36)) (not (= .cse34 .cse36)) (not (= .cse34 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= .cse35 0)) (not (= .cse34 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse39 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse39 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse41 (select .cse45 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse40 (select .cse45 .cse39))) (and (= .cse40 .cse41) (not (= .cse41 0)) (not (= .cse40 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse44 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse43 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse42 (select .cse43 .cse44))) (and (= .cse42 (select .cse43 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse42)) (not (= .cse40 .cse42)))))) (not (= .cse44 0))))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse51 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)) (.cse50 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse47 (select .cse50 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse46 (select .cse50 .cse51))) (and (= .cse46 .cse47) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse48 (select .cse49 .cse51))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse48)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 (select .cse49 0))) (= .cse48 (select .cse49 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= (select .cse50 0) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= .cse47 0)) (not (= .cse46 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse52 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse52 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse55 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse54 (select .cse55 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse53 (select .cse55 .cse52))) (and (= .cse53 .cse54) (not (= .cse54 0)) (not (= .cse53 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse57 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse56 (select .cse57 .cse52))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse56)) (= .cse56 (select .cse57 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse59 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse62 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse60 (select .cse62 (- 16))) (.cse58 (select .cse59 (+ 8 v_arrayElimCell_45))) (.cse61 (select .cse62 8))) (and (= .cse58 (select .cse59 (+ (- 16) v_arrayElimCell_45))) (not (= .cse60 0)) (not (= .cse58 .cse61)) (= .cse60 .cse61) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse58)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse61)))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse64 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse67 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse65 (select .cse67 (- 16))) (.cse63 (select .cse64 (+ 8 v_arrayElimCell_45))) (.cse66 (select .cse67 8))) (and (= .cse63 (select .cse64 (+ (- 16) v_arrayElimCell_45))) (not (= .cse65 0)) (not (= 16 v_arrayElimCell_45)) (not (= .cse63 .cse66)) (= .cse65 .cse66) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse63)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse63)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse66)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse73 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse69 (select .cse73 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse68 (select .cse73 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse68 .cse69) (not (= .cse69 0)) (not (= .cse68 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((v_arrayElimCell_45 Int)) (let ((.cse70 (+ 8 v_arrayElimCell_45))) (and (not (= 16 v_arrayElimCell_45)) (not (= .cse70 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse72 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse71 (select .cse72 .cse70))) (and (= .cse71 (select .cse72 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse71)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse71)) (not (= .cse68 .cse71))))))))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse74 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse74 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse79 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (.cse78 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse75 (select .cse78 .cse74)) (.cse77 (select .cse79 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse76 (select .cse79 .cse74))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse75)) (= .cse76 .cse77) (= .cse75 (select .cse78 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= .cse77 0)) (not (= .cse76 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse79 24))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse81 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse84 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse82 (select .cse84 (- 16))) (.cse80 (select .cse81 (+ 8 v_arrayElimCell_45))) (.cse83 (select .cse84 8))) (and (= .cse80 (select .cse81 (+ (- 16) v_arrayElimCell_45))) (not (= .cse82 0)) (not (= 16 v_arrayElimCell_45)) (not (= .cse80 .cse83)) (= .cse82 .cse83) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse80)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse83)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse85 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse85 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse90 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse87 (select .cse90 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse86 (select .cse90 .cse85))) (and (= .cse86 .cse87) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse89 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse88 (select .cse89 (+ 8 v_arrayElimCell_45)))) (and (= .cse88 (select .cse89 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse88)) (not (= .cse86 .cse88)) (not (= .cse86 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))))) (not (= .cse87 0)) (not (= .cse86 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse95 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse92 (select .cse95 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse91 (select .cse95 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse91 .cse92) (not (= .cse92 0)) (not (= .cse91 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse94 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse93 (select .cse94 8))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse93)) (= .cse93 (select .cse94 (- 16))) (not (= .cse91 .cse93)))))))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse96 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse96 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse101 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse98 (select .cse101 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse97 (select .cse101 .cse96))) (and (= .cse97 .cse98) (not (= .cse98 0)) (not (= .cse97 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse100 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse99 (select .cse100 .cse96))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse99)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 (select .cse100 24))) (= .cse99 (select .cse100 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse101 24))) (not (= (select .cse101 0) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))))))))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse106 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse103 (select .cse106 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse102 (select .cse106 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse102 .cse103) (not (= .cse103 0)) (not (= .cse102 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((v_arrayElimCell_45 Int)) (and (not (= 16 v_arrayElimCell_45)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse105 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse104 (select .cse105 (+ 8 v_arrayElimCell_45)))) (and (= .cse104 (select .cse105 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse104)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse104)) (not (= .cse102 .cse104)) (not (= .cse102 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse107 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (not (= .cse107 0)) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse112 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (.cse111 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse108 (select .cse111 .cse107)) (.cse110 (select .cse112 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse109 (select .cse112 .cse107))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse108)) (= .cse109 .cse110) (= .cse108 (select .cse111 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= .cse110 0)) (not (= .cse109 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse112 24))) (not (= (select .cse112 0) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse118 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)) (.cse117 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse114 (select .cse117 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse113 (select .cse117 .cse118))) (and (= .cse113 .cse114) (not (= .cse114 0)) (not (= .cse113 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse116 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse115 (select .cse116 .cse118))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse115)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 (select .cse116 0))) (= .cse115 (select .cse116 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse117 24))) (not (= (select .cse117 0) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse123 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse120 (select .cse123 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse119 (select .cse123 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24)))) (and (= .cse119 .cse120) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse122 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse121 (select .cse122 (+ 8 v_arrayElimCell_45)))) (and (= .cse121 (select .cse122 (+ (- 16) v_arrayElimCell_45))) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse121)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse121)) (not (= .cse119 .cse121)) (not (= .cse119 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)))))) (not (= .cse120 0)) (not (= .cse119 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (not (= v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 0)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 Int)) (let ((.cse129 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_13 24))) (and (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int)) (let ((.cse128 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse125 (select .cse128 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (.cse124 (select .cse128 .cse129))) (and (= .cse124 .cse125) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse127 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|))) (let ((.cse126 (select .cse127 .cse129))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse126)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 (select .cse127 24))) (= .cse126 (select .cse127 v_aws_linked_list_back_~list.offset_BEFORE_CALL_13)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| (select .cse128 24))))))) (not (= .cse125 0)) (not (= .cse124 v_aws_linked_list_back_~list.base_BEFORE_CALL_15)))))) (not (= .cse129 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_15 Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (v_arrayElimCell_45 Int)) (let ((.cse131 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|)) (.cse134 (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_15))) (let ((.cse132 (select .cse134 (- 16))) (.cse130 (select .cse131 (+ 8 v_arrayElimCell_45))) (.cse133 (select .cse134 8))) (and (= .cse130 (select .cse131 (+ (- 16) v_arrayElimCell_45))) (not (= .cse132 0)) (not (= .cse130 .cse133)) (= .cse132 .cse133) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse130)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse130)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_15 .cse133))))))) is different from true