./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:49:09,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:49:09,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:49:09,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:49:09,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:49:09,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:49:09,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:49:09,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:49:09,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:49:09,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:49:09,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:49:09,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:49:09,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:49:09,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:49:09,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:09,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:09,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:49:09,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:49:09,176 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2025-01-09 02:49:09,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:49:09,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:49:09,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:49:09,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:49:09,431 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:49:09,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-01-09 02:49:10,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5593dee7/efe47d737f4d4d919168f03b0c73b0d8/FLAG57d724345 [2025-01-09 02:49:10,912 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:49:10,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-01-09 02:49:10,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5593dee7/efe47d737f4d4d919168f03b0c73b0d8/FLAG57d724345 [2025-01-09 02:49:11,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5593dee7/efe47d737f4d4d919168f03b0c73b0d8 [2025-01-09 02:49:11,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:49:11,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:49:11,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:11,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:49:11,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:49:11,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c14591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11, skipping insertion in model container [2025-01-09 02:49:11,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:49:11,430 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/list-simple/sll2c_append_unequal.i[24587,24600] [2025-01-09 02:49:11,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:11,442 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:49:11,484 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/list-simple/sll2c_append_unequal.i[24587,24600] [2025-01-09 02:49:11,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:11,505 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:49:11,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11 WrapperNode [2025-01-09 02:49:11,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:11,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:11,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:49:11,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:49:11,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,540 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2025-01-09 02:49:11,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:11,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:49:11,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:49:11,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:49:11,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,566 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 10, 16]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2025-01-09 02:49:11,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:49:11,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:49:11,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:49:11,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:49:11,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:11,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:11,604 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 02:49:11,607 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 02:49:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:49:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:49:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:49:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:49:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:49:11,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:49:11,751 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:49:11,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:49:11,953 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 02:49:11,953 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:49:11,960 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:49:11,960 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 02:49:11,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:11 BoogieIcfgContainer [2025-01-09 02:49:11,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:49:11,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:49:11,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:49:11,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:49:11,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:49:11" (1/3) ... [2025-01-09 02:49:11,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbda1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:11, skipping insertion in model container [2025-01-09 02:49:11,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11" (2/3) ... [2025-01-09 02:49:11,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbda1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:11, skipping insertion in model container [2025-01-09 02:49:11,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:11" (3/3) ... [2025-01-09 02:49:11,969 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2025-01-09 02:49:11,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:49:11,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 39 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 02:49:12,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:49:12,029 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;@5f4b90fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:49:12,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:49:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:49:12,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:12,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:12,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1737730359, now seen corresponding path program 1 times [2025-01-09 02:49:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260263732] [2025-01-09 02:49:12,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:12,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:49:12,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:49:12,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:12,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:49:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260263732] [2025-01-09 02:49:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260263732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:12,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:12,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:49:12,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75327131] [2025-01-09 02:49:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:49:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:12,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:49:12,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:12,368 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:12,392 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2025-01-09 02:49:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:49:12,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-01-09 02:49:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:12,399 INFO L225 Difference]: With dead ends: 74 [2025-01-09 02:49:12,399 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 02:49:12,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:12,403 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:12,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 02:49:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-01-09 02:49:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-01-09 02:49:12,433 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 24 [2025-01-09 02:49:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:12,433 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-01-09 02:49:12,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-01-09 02:49:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 02:49:12,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:12,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:12,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:49:12,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:12,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash -120734529, now seen corresponding path program 1 times [2025-01-09 02:49:12,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:12,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725194262] [2025-01-09 02:49:12,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:12,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:49:12,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:49:12,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:12,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:49:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725194262] [2025-01-09 02:49:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725194262] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906874506] [2025-01-09 02:49:12,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:12,848 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 02:49:12,849 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 02:49:12,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:49:12,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:49:12,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:12,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:12,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 02:49:12,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:13,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:49:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:13,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:49:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906874506] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:13,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-01-09 02:49:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823406397] [2025-01-09 02:49:13,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:13,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:49:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:49:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:49:13,184 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:49:17,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:21,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:25,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:29,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:29,396 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-01-09 02:49:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:49:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2025-01-09 02:49:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:29,397 INFO L225 Difference]: With dead ends: 52 [2025-01-09 02:49:29,397 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 02:49:29,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:49:29,398 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:29,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 286 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-01-09 02:49:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 02:49:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-01-09 02:49:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-01-09 02:49:29,403 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 33 [2025-01-09 02:49:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:29,404 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-01-09 02:49:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:49:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-01-09 02:49:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:49:29,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:29,404 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:29,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:49:29,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:29,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:29,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1400022720, now seen corresponding path program 1 times [2025-01-09 02:49:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:29,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754281229] [2025-01-09 02:49:29,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:29,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:29,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:49:29,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:49:29,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:29,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:30,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:30,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754281229] [2025-01-09 02:49:30,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754281229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:30,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932814713] [2025-01-09 02:49:30,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:30,346 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 02:49:30,347 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 02:49:30,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:49:30,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:49:30,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:30,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:30,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 02:49:30,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:30,478 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 02:49:30,606 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:30,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:30,649 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 11 treesize of output 7 [2025-01-09 02:49:30,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:30,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 02:49:30,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-01-09 02:49:30,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-01-09 02:49:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:30,894 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 46 treesize of output 35 [2025-01-09 02:49:30,908 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-01-09 02:49:30,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-01-09 02:49:31,024 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-01-09 02:49:31,024 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 1 case distinctions, treesize of input 53 treesize of output 59 [2025-01-09 02:49:31,045 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-01-09 02:49:31,046 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2025-01-09 02:49:31,056 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 22 treesize of output 16 [2025-01-09 02:49:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 02:49:31,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-01-09 02:49:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:49:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:31,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932814713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:31,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:31,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 31 [2025-01-09 02:49:31,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24267172] [2025-01-09 02:49:31,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:31,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:49:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:31,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:49:31,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1024, Unknown=11, NotChecked=0, Total=1122 [2025-01-09 02:49:31,344 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 24 states have internal predecessors, (50), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:49:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:32,000 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2025-01-09 02:49:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 02:49:32,001 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 24 states have internal predecessors, (50), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-01-09 02:49:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:32,002 INFO L225 Difference]: With dead ends: 82 [2025-01-09 02:49:32,002 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 02:49:32,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1973, Unknown=11, NotChecked=0, Total=2162 [2025-01-09 02:49:32,005 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:32,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 425 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:49:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 02:49:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2025-01-09 02:49:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:49:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-01-09 02:49:32,017 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 36 [2025-01-09 02:49:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:32,018 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-01-09 02:49:32,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 24 states have internal predecessors, (50), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:49:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-01-09 02:49:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 02:49:32,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:32,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:32,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:49:32,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:32,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1612373888, now seen corresponding path program 1 times [2025-01-09 02:49:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108617687] [2025-01-09 02:49:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 02:49:32,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:49:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:49:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108617687] [2025-01-09 02:49:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108617687] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343760319] [2025-01-09 02:49:32,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:32,880 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 02:49:32,883 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 02:49:32,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 02:49:33,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:49:33,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:33,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-01-09 02:49:33,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:33,300 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 02:49:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:33,533 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:33,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:33,602 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 23 treesize of output 11 [2025-01-09 02:49:33,649 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 02:49:33,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:33,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-01-09 02:49:33,935 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:49:33,935 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 20 treesize of output 23 [2025-01-09 02:49:33,961 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 02:49:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-09 02:49:34,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:49:34,298 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-09 02:49:34,301 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 20 treesize of output 15 [2025-01-09 02:49:34,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:49:34,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:36,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_436 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_436)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_438) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-01-09 02:49:36,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 02:49:36,406 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_436 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_436))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_438) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-01-09 02:49:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343760319] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:36,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 41 [2025-01-09 02:49:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176525839] [2025-01-09 02:49:36,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 02:49:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:36,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 02:49:36,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2022, Unknown=11, NotChecked=182, Total=2352 [2025-01-09 02:49:36,542 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 41 states, 38 states have (on average 1.631578947368421) internal successors, (62), 33 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:37,675 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2025-01-09 02:49:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:49:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.631578947368421) internal successors, (62), 33 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-01-09 02:49:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:37,676 INFO L225 Difference]: With dead ends: 73 [2025-01-09 02:49:37,676 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 02:49:37,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=272, Invalid=3507, Unknown=11, NotChecked=242, Total=4032 [2025-01-09 02:49:37,678 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:37,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 503 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 02:49:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 02:49:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-01-09 02:49:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:49:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-01-09 02:49:37,691 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 39 [2025-01-09 02:49:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:37,691 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-01-09 02:49:37,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.631578947368421) internal successors, (62), 33 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-01-09 02:49:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 02:49:37,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:37,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:37,701 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 02:49:37,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:37,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -508174851, now seen corresponding path program 1 times [2025-01-09 02:49:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:37,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242453505] [2025-01-09 02:49:37,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:37,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 02:49:37,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:49:37,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:37,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242453505] [2025-01-09 02:49:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242453505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521330781] [2025-01-09 02:49:39,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:39,538 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 02:49:39,539 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 02:49:39,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 02:49:39,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:49:39,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:39,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:39,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-01-09 02:49:39,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:39,854 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 02:49:39,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:40,043 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:40,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:40,098 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 11 treesize of output 7 [2025-01-09 02:49:40,106 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 23 treesize of output 11 [2025-01-09 02:49:40,110 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 11 treesize of output 7 [2025-01-09 02:49:40,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:40,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-01-09 02:49:40,162 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 24 treesize of output 11 [2025-01-09 02:49:40,170 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 24 treesize of output 11 [2025-01-09 02:49:40,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 02:49:40,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:40,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-01-09 02:49:40,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:40,520 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:49:40,522 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 20 treesize of output 23 [2025-01-09 02:49:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:40,541 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 38 treesize of output 27 [2025-01-09 02:49:40,555 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:40,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:40,562 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 20 treesize of output 15 [2025-01-09 02:49:40,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 02:49:40,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-01-09 02:49:41,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2025-01-09 02:49:41,122 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:49:41,122 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 15 treesize of output 7 [2025-01-09 02:49:41,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:41,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:46,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521330781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:46,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 45 [2025-01-09 02:49:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061107862] [2025-01-09 02:49:46,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:46,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 02:49:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:46,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 02:49:46,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2777, Unknown=31, NotChecked=0, Total=2970 [2025-01-09 02:49:46,026 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 45 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:49:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:48,393 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2025-01-09 02:49:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 02:49:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-01-09 02:49:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:48,396 INFO L225 Difference]: With dead ends: 123 [2025-01-09 02:49:48,396 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 02:49:48,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=429, Invalid=7020, Unknown=33, NotChecked=0, Total=7482 [2025-01-09 02:49:48,398 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 147 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:48,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 962 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 02:49:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 02:49:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2025-01-09 02:49:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.16) internal successors, (87), 75 states have internal predecessors, (87), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:49:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-01-09 02:49:48,407 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 42 [2025-01-09 02:49:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:48,408 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-01-09 02:49:48,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:49:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-01-09 02:49:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 02:49:48,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:48,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:48,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 02:49:48,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:48,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:48,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -469183648, now seen corresponding path program 2 times [2025-01-09 02:49:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:48,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920858765] [2025-01-09 02:49:48,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:48,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-09 02:49:48,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 02:49:48,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:48,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920858765] [2025-01-09 02:49:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920858765] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89487071] [2025-01-09 02:49:52,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:52,342 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 02:49:52,343 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 02:49:52,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-09 02:49:52,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 02:49:52,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:52,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:52,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-09 02:49:52,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:52,750 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 02:49:52,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:52,948 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:52,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:53,015 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 11 treesize of output 7 [2025-01-09 02:49:53,022 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 11 treesize of output 7 [2025-01-09 02:49:53,035 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 23 treesize of output 11 [2025-01-09 02:49:53,095 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:53,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2025-01-09 02:49:53,101 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 22 [2025-01-09 02:49:53,107 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 24 treesize of output 11 [2025-01-09 02:49:53,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-01-09 02:49:53,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-01-09 02:49:53,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2025-01-09 02:49:53,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:53,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:53,490 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 53 treesize of output 36 [2025-01-09 02:49:53,506 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2025-01-09 02:49:53,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 40 [2025-01-09 02:49:53,530 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:53,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:53,540 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 20 treesize of output 15 [2025-01-09 02:49:54,315 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:54,316 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:54,316 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:54,320 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:49:54,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 53 [2025-01-09 02:49:54,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-01-09 02:49:54,728 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-01-09 02:49:54,749 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 02:49:54,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 53 [2025-01-09 02:49:54,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-01-09 02:49:54,758 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 12 treesize of output 1 [2025-01-09 02:49:54,764 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:49:54,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2025-01-09 02:49:55,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 71 [2025-01-09 02:49:55,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:55,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 128 [2025-01-09 02:49:55,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:49:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:55,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:55,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 02:49:55,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~last~2#1.base_16| Int) (v_ArrVal_741 (Array Int Int))) (not (= .cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_741))) (select (select .cse1 |v_ULTIMATE.start_main_~last~2#1.base_16|) (select (select .cse1 .cse2) .cse0)))))) (forall ((v_ArrVal_738 (Array Int Int)) (v_ArrVal_742 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_742) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_738) .cse2) (+ .cse0 4))) (not (= v_ArrVal_742 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_742 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))))) is different from false [2025-01-09 02:49:57,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89487071] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:57,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:57,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 57 [2025-01-09 02:49:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898357694] [2025-01-09 02:49:57,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:57,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-01-09 02:49:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:57,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-01-09 02:49:57,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=4819, Unknown=2, NotChecked=140, Total=5256 [2025-01-09 02:49:57,421 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 57 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 48 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:00,521 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2025-01-09 02:50:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 02:50:00,522 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 48 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2025-01-09 02:50:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:00,522 INFO L225 Difference]: With dead ends: 122 [2025-01-09 02:50:00,522 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 02:50:00,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=648, Invalid=8860, Unknown=2, NotChecked=192, Total=9702 [2025-01-09 02:50:00,524 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:00,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 520 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 02:50:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 02:50:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2025-01-09 02:50:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:50:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2025-01-09 02:50:00,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 45 [2025-01-09 02:50:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2025-01-09 02:50:00,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 48 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2025-01-09 02:50:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 02:50:00,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:00,540 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-01-09 02:50:00,550 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 02:50:00,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:00,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1542357, now seen corresponding path program 1 times [2025-01-09 02:50:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98368347] [2025-01-09 02:50:00,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:00,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 02:50:00,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 02:50:00,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:00,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 02:50:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98368347] [2025-01-09 02:50:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98368347] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842864235] [2025-01-09 02:50:00,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:00,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:00,811 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 02:50:00,812 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 02:50:00,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 02:50:00,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 02:50:00,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:00,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:00,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:50:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:50:00,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:50:00,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842864235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:50:00,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:50:00,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 02:50:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930976913] [2025-01-09 02:50:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:50:00,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:50:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:00,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:50:00,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:50:00,965 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:00,985 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2025-01-09 02:50:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:50:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-01-09 02:50:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:00,986 INFO L225 Difference]: With dead ends: 105 [2025-01-09 02:50:00,986 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 02:50:00,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:50:00,988 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:00,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:50:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 02:50:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 02:50:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-01-09 02:50:01,003 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 47 [2025-01-09 02:50:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:01,004 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-01-09 02:50:01,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-01-09 02:50:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 02:50:01,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:01,005 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:01,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:01,206 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,SelfDestructingSolverStorable6 [2025-01-09 02:50:01,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1476575005, now seen corresponding path program 3 times [2025-01-09 02:50:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403306929] [2025-01-09 02:50:01,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:50:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:01,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes. [2025-01-09 02:50:01,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 02:50:01,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:50:01,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:50:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403306929] [2025-01-09 02:50:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403306929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285179407] [2025-01-09 02:50:03,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:50:03,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:03,953 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 02:50:03,954 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 02:50:04,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes. [2025-01-09 02:50:04,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 02:50:04,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:50:04,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:04,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 174 conjuncts are in the unsatisfiable core [2025-01-09 02:50:04,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:04,405 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 02:50:04,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:04,549 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2025-01-09 02:50:04,551 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2025-01-09 02:50:04,561 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 23 treesize of output 11 [2025-01-09 02:50:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:04,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:04,583 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2025-01-09 02:50:04,584 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2025-01-09 02:50:04,603 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:50:04,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2025-01-09 02:50:04,616 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 02:50:04,617 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 24 treesize of output 19 [2025-01-09 02:50:04,631 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 02:50:04,632 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 24 treesize of output 19 [2025-01-09 02:50:04,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse2))) (and (or .cse0 (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)))))) is different from false [2025-01-09 02:50:04,652 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse2))) (and (or .cse0 (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)))))) is different from true [2025-01-09 02:50:04,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= .cse0 .cse3))) (and (= (select |c_#valid| .cse0) 1) (or .cse1 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-01-09 02:50:04,681 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= .cse0 .cse3))) (and (= (select |c_#valid| .cse0) 1) (or .cse1 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-01-09 02:50:04,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2025-01-09 02:50:04,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:50:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:50:04,714 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:50:04,715 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:50:04,736 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:50:04,737 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:50:04,785 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|)) is different from false [2025-01-09 02:50:04,787 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|)) is different from true [2025-01-09 02:50:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:04,823 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 36 treesize of output 31 [2025-01-09 02:50:04,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:04,829 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 76 treesize of output 59 [2025-01-09 02:50:04,844 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:50:04,844 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 36 treesize of output 39 [2025-01-09 02:50:04,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (or .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from false [2025-01-09 02:50:04,893 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (or .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from true [2025-01-09 02:50:04,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from false [2025-01-09 02:50:04,949 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from true [2025-01-09 02:50:05,015 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from false [2025-01-09 02:50:05,017 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse4) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from true [2025-01-09 02:50:05,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse6) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_20| .cse7)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from false [2025-01-09 02:50:05,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (= .cse3 .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) .cse2 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse6) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_20| .cse7)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))))))) is different from true [2025-01-09 02:50:05,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse3 (= .cse4 .cse8)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse7))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse3 (= (select (select |c_#memory_int#2| .cse4) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse3 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse7 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse8) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_20| .cse9)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0))))))) is different from false [2025-01-09 02:50:05,243 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse3 (= .cse4 .cse8)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse7))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse3 (= (select (select |c_#memory_int#2| .cse4) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse3 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse7 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse8) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_20| .cse9)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0))))))) is different from true [2025-01-09 02:50:05,300 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (let ((.cse6 (= .cse7 .cse8))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse4))) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) .cse4)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) .cse5))))) (or .cse6 (= (select (select |c_#memory_int#2| .cse7) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) .cse6 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse7) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse8) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_20| .cse9)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0))))))) is different from false [2025-01-09 02:50:05,302 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (let ((.cse6 (= .cse7 .cse8))) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse4))) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) .cse4)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) .cse5))))) (or .cse6 (= (select (select |c_#memory_int#2| .cse7) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) .cse6 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse7) 0))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse8) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_20| .cse9)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0))))))) is different from true [2025-01-09 02:50:05,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse5 (= .cse0 .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (and (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse5 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0) .cse5 (= 0 .cse2)) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_20| .cse6)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))))))) is different from false [2025-01-09 02:50:05,567 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse5 (= .cse0 .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (and (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (or .cse5 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0) .cse5 (= 0 .cse2)) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_20| .cse6)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))))))) is different from true [2025-01-09 02:50:05,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse5 (= .cse0 .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (and (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (or .cse5 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0) .cse5 (= 0 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_20| .cse6)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))))))) is different from false [2025-01-09 02:50:05,620 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse5 (= .cse0 .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (and (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (or .cse5 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0) .cse5 (= 0 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse1) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_20| .cse6)))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))))))) is different from true [2025-01-09 02:50:05,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:05,693 INFO L349 Elim1Store]: treesize reduction 72, result has 51.0 percent of original size [2025-01-09 02:50:05,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 147 [2025-01-09 02:50:05,748 INFO L349 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2025-01-09 02:50:05,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 139 [2025-01-09 02:50:05,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:05,791 INFO L349 Elim1Store]: treesize reduction 82, result has 22.6 percent of original size [2025-01-09 02:50:05,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 127 [2025-01-09 02:50:05,818 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-01-09 02:50:05,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 54 [2025-01-09 02:50:05,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:05,828 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 36 treesize of output 27 [2025-01-09 02:50:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:05,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:05,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:05,841 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2025-01-09 02:50:05,918 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 33 treesize of output 27 [2025-01-09 02:50:09,178 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse9 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (.cse6 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (.cse2 (select .cse12 0))) (or (and (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse3)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_#valid_BEFORE_CALL_20| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1))) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) .cse6) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_20| .cse7)))) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1))) (and .cse6 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse3)) (= |v_#valid_BEFORE_CALL_20| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_20| .cse8)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))))) .cse9) (and (or (and (or (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int)) (and (= (select |v_#valid_BEFORE_CALL_21| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_20| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse10 (select |v_#valid_BEFORE_CALL_20| .cse10)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) .cse6) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse11 (select |v_#valid_BEFORE_CALL_20| .cse11)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) .cse6)) .cse9) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_20| (select .cse12 4)) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse13 (select |v_#valid_BEFORE_CALL_20| .cse13)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) .cse6)) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3)))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) is different from false [2025-01-09 02:50:09,183 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse9 (= (select (select |c_#memory_int#2| .cse3) 4) 1)) (.cse6 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (.cse2 (select .cse12 0))) (or (and (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse3)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_#valid_BEFORE_CALL_20| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1))) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) .cse6) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_20| .cse7)))) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1))) (and .cse6 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse2) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse3)) (= |v_#valid_BEFORE_CALL_20| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_20| .cse8)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))))) .cse9) (and (or (and (or (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int)) (and (= (select |v_#valid_BEFORE_CALL_21| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_20| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse10 (select |v_#valid_BEFORE_CALL_20| .cse10)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) .cse6) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse2) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse11 (select |v_#valid_BEFORE_CALL_20| .cse11)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) .cse6)) .cse9) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_20| (select .cse12 4)) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse13 (select |v_#valid_BEFORE_CALL_20| .cse13)))) (= (select |v_#valid_BEFORE_CALL_20| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 0))) .cse6)) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3)))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) is different from true [2025-01-09 02:50:13,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse9 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (.cse6 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (.cse3 (select .cse12 0))) (or (and (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_#valid_BEFORE_CALL_20| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) .cse6) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_20| .cse7)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and .cse6 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= |v_#valid_BEFORE_CALL_20| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_20| .cse8)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))))) .cse9) (and (or (and (or (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int)) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse10 (select |v_#valid_BEFORE_CALL_20| .cse10)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse6) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse11 (select |v_#valid_BEFORE_CALL_20| .cse11)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse6)) .cse9) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| (select .cse12 4)) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse13 (select |v_#valid_BEFORE_CALL_20| .cse13)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse6)) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~last~2#1.offset| 0))) is different from false [2025-01-09 02:50:13,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse9 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (.cse6 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (.cse3 (select .cse12 0))) (or (and (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_#valid_BEFORE_CALL_20| .cse4)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) .cse6) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_20| .cse7)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and .cse6 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= |v_#valid_BEFORE_CALL_20| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_20| .cse8)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))))) .cse9) (and (or (and (or (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int)) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse10 (select |v_#valid_BEFORE_CALL_20| .cse10)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse6) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse11 (select |v_#valid_BEFORE_CALL_20| .cse11)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse6)) .cse9) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| (select .cse12 4)) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse13 (select |v_#valid_BEFORE_CALL_20| .cse13)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse6)) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~last~2#1.offset| 0))) is different from true [2025-01-09 02:50:17,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse3 (select .cse13 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (.cse7 (= 0 .cse4))) (or (and (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_20| .cse6)))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) .cse7) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_20| .cse8)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= |v_#valid_BEFORE_CALL_20| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_20| .cse9)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))))) .cse10) (and (or (and (or (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int)) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse11 (select |v_#valid_BEFORE_CALL_20| .cse11)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse7) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse12 (select |v_#valid_BEFORE_CALL_20| .cse12)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse7)) .cse10) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| (select .cse13 4)) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse14 (select |v_#valid_BEFORE_CALL_20| .cse14)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse7)) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-01-09 02:50:17,468 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse3 (select .cse13 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (v_arrayElimCell_106 Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_19| .cse1)))) (= (select |v_#valid_BEFORE_CALL_19| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_106) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (= (select (select |c_#memory_int#2| .cse0) 4) 1)) (.cse7 (= 0 .cse4))) (or (and (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_20| .cse5)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_20| .cse6)))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) .cse7) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (exists ((v_arrayElimIndex_8 Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_8) 0) 0)) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))) (= |v_#valid_BEFORE_CALL_20| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_20| .cse8)))) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1))) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_20| .cse3) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_8) 0) .cse0)) (= |v_#valid_BEFORE_CALL_20| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_20| .cse9)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimIndex_8) 1))))) .cse10) (and (or (and (or (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int)) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse11 (select |v_#valid_BEFORE_CALL_20| .cse11)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse7) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= |v_#valid_BEFORE_CALL_20| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse12 (select |v_#valid_BEFORE_CALL_20| .cse12)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse7)) .cse10) (and (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_20| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| (select .cse13 4)) 0) (= |v_#valid_BEFORE_CALL_20| (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_20|))) (store |v_#valid_BEFORE_CALL_21| .cse14 (select |v_#valid_BEFORE_CALL_20| .cse14)))) (= (select |v_#valid_BEFORE_CALL_20| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_21| .cse0) 0))) .cse7)) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-01-09 02:50:17,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:17,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 595 treesize of output 435 [2025-01-09 02:50:17,633 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:50:17,633 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 15 treesize of output 7 [2025-01-09 02:50:17,878 INFO L349 Elim1Store]: treesize reduction 72, result has 64.2 percent of original size [2025-01-09 02:50:17,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 411 treesize of output 470 [2025-01-09 02:50:18,016 INFO L349 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2025-01-09 02:50:18,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 364 treesize of output 367