./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.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/dll2c_prepend_equal.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:47:24,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:47:24,454 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:47:24,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:47:24,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:47:24,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:47:24,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:47:24,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:47:24,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:47:24,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:47:24,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:47:24,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:47:24,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:47:24,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:47:24,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:47:24,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:47:24,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:24,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:24,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:47:24,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:47:24,479 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2025-01-09 02:47:24,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:47:24,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:47:24,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:47:24,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:47:24,674 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:47:24,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2025-01-09 02:47:25,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bcf92a3/58562815f62b49aa9caa5d21fc862807/FLAGfb12739df [2025-01-09 02:47:26,130 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:47:26,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2025-01-09 02:47:26,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bcf92a3/58562815f62b49aa9caa5d21fc862807/FLAGfb12739df [2025-01-09 02:47:26,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bcf92a3/58562815f62b49aa9caa5d21fc862807 [2025-01-09 02:47:26,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:47:26,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:47:26,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:47:26,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:47:26,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:47:26,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5532132c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26, skipping insertion in model container [2025-01-09 02:47:26,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:47:26,657 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/dll2c_prepend_equal.i[24640,24653] [2025-01-09 02:47:26,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:47:26,670 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:47:26,709 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/dll2c_prepend_equal.i[24640,24653] [2025-01-09 02:47:26,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:47:26,727 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:47:26,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26 WrapperNode [2025-01-09 02:47:26,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:47:26,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:47:26,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:47:26,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:47:26,736 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:47:26" (1/1) ... [2025-01-09 02:47:26,743 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:47:26" (1/1) ... [2025-01-09 02:47:26,760 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 130 [2025-01-09 02:47:26,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:47:26,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:47:26,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:47:26,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:47:26,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,780 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2025-01-09 02:47:26,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:47:26,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:47:26,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:47:26,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:47:26,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:26,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:26,822 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:47:26,824 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:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:47:26,850 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:47:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:47:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:47:26,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:47:26,966 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:47:26,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:47:27,146 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 02:47:27,146 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:47:27,152 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:47:27,152 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:47:27,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:27 BoogieIcfgContainer [2025-01-09 02:47:27,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:47:27,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:47:27,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:47:27,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:47:27,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:26" (1/3) ... [2025-01-09 02:47:27,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d20a1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:27, skipping insertion in model container [2025-01-09 02:47:27,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (2/3) ... [2025-01-09 02:47:27,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d20a1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:27, skipping insertion in model container [2025-01-09 02:47:27,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:27" (3/3) ... [2025-01-09 02:47:27,160 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2025-01-09 02:47:27,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:47:27,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_prepend_equal.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 02:47:27,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:47:27,218 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;@5c815904, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:47:27,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:47:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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:47:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:47:27,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:27,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:47:27,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:27,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1826935511, now seen corresponding path program 1 times [2025-01-09 02:47:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:27,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879522321] [2025-01-09 02:47:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:27,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:47:27,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:47:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:27,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:27,559 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:47:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:27,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879522321] [2025-01-09 02:47:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879522321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:47:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:47:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:47:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977327163] [2025-01-09 02:47:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:47:27,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:47:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:27,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:47:27,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:47:27,581 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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.0) internal successors, (15), 3 states have internal predecessors, (15), 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:47:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:27,611 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2025-01-09 02:47:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:47:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-01-09 02:47:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:27,617 INFO L225 Difference]: With dead ends: 60 [2025-01-09 02:47:27,617 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 02:47:27,619 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:47:27,622 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 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:47:27,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 02:47:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-01-09 02:47:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:47:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-01-09 02:47:27,650 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2025-01-09 02:47:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-01-09 02:47:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:47:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-01-09 02:47:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 02:47:27,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:27,652 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:47:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:47:27,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2072324213, now seen corresponding path program 1 times [2025-01-09 02:47:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194636883] [2025-01-09 02:47:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:27,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:47:27,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:47:27,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:27,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:28,146 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:47:28,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194636883] [2025-01-09 02:47:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194636883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096172077] [2025-01-09 02:47:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:28,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:28,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:28,155 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:47:28,157 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:47:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:47:28,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:47:28,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:28,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:28,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 02:47:28,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:28,501 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:47:28,516 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:47:28,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:47:28,581 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:47:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096172077] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:47:28,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:47:28,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-01-09 02:47:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311287882] [2025-01-09 02:47:28,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:47:28,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:47:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:28,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:47:28,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:47:28,586 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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:47:32,617 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:47:36,629 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:47:40,637 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:47:44,656 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:47:48,914 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:47:52,948 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:47:56,976 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:47:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:56,981 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-01-09 02:47:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:47:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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:47:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:56,985 INFO L225 Difference]: With dead ends: 55 [2025-01-09 02:47:56,985 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 02:47:56,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:47:56,986 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:47:56,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 227 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2025-01-09 02:47:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 02:47:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-09 02:47:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:47:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-01-09 02:47:56,993 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 33 [2025-01-09 02:47:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-01-09 02:47:56,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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:47:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-01-09 02:47:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 02:47:56,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:56,995 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:47:57,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:47:57,196 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:47:57,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:57,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2074171255, now seen corresponding path program 1 times [2025-01-09 02:47:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:57,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973957920] [2025-01-09 02:47:57,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:57,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:47:57,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:47:57,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:57,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:47:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973957920] [2025-01-09 02:47:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973957920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459854868] [2025-01-09 02:47:59,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:59,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:59,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:59,193 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:47:59,194 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:47:59,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:47:59,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:47:59,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:59,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:59,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-09 02:47:59,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:59,335 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:47:59,424 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 02:47:59,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2025-01-09 02:47:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-01-09 02:47:59,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2025-01-09 02:47:59,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-01-09 02:47:59,537 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 02:47:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 02:47:59,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:47:59,667 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 80 treesize of output 45 [2025-01-09 02:47:59,676 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2025-01-09 02:47:59,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2025-01-09 02:47:59,704 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:47:59,790 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2025-01-09 02:47:59,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 100 [2025-01-09 02:47:59,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse0 .cse3))) (and (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1)) (not (= .cse1 .cse2))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse1))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse5 .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0))) is different from false [2025-01-09 02:47:59,841 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse0 .cse3))) (and (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1)) (not (= .cse1 .cse2))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse1))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse5 .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0))) is different from true [2025-01-09 02:47:59,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse0 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse3))) (and (not (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse3))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 .cse1))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse3)) (not (= .cse3 .cse4)))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)))) is different from false [2025-01-09 02:47:59,886 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse0 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse3))) (and (not (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse3))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 .cse1))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse3)) (not (= .cse3 .cse4)))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)))) is different from true [2025-01-09 02:47:59,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:47:59,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:47:59,919 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 85 treesize of output 26 [2025-01-09 02:47:59,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 15 [2025-01-09 02:47:59,931 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 0 case distinctions, treesize of input 72 treesize of output 41 [2025-01-09 02:47:59,934 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 0 case distinctions, treesize of input 44 treesize of output 32 [2025-01-09 02:47:59,937 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 25 treesize of output 13 [2025-01-09 02:47:59,945 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:47:59,945 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:47:59,948 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:47:59,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:47:59,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:47:59,958 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:47:59,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:47:59,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:47:59,965 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 72 treesize of output 26 [2025-01-09 02:47:59,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 15 [2025-01-09 02:47:59,979 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:47:59,985 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:47:59,990 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 15 treesize of output 7 [2025-01-09 02:47:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:47:59,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:00,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_471 (Array Int Int))) (or (not (= v_ArrVal_471 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_471 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_468) .cse1 v_ArrVal_470) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_471) .cse0 v_ArrVal_468) .cse1 v_ArrVal_470) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_472)))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2025-01-09 02:48:00,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_471 (Array Int Int))) (or (not (= v_ArrVal_471 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_471 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_468) .cse1 v_ArrVal_470) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_471) .cse0 v_ArrVal_468) .cse1 v_ArrVal_470) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4) v_ArrVal_472)))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2025-01-09 02:48:00,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:00,135 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 3878 treesize of output 3868 [2025-01-09 02:48:00,163 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 1212 treesize of output 1132 [2025-01-09 02:48:00,173 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 1436 treesize of output 1276 [2025-01-09 02:48:00,235 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 19 treesize of output 3 [2025-01-09 02:48:00,444 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 4695 treesize of output 4503 [2025-01-09 02:48:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459854868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:00,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:48:00,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2025-01-09 02:48:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928689143] [2025-01-09 02:48:00,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:00,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 02:48:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:00,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 02:48:00,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=971, Unknown=6, NotChecked=260, Total=1332 [2025-01-09 02:48:00,953 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 32 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:01,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse0 .cse3))) (and (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1)) (not (= .cse1 .cse2))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse1))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse5 .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1))))))) (= 1 (select |c_#valid| .cse6)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7)) (= (select |c_#valid| .cse7) 1)))) is different from false [2025-01-09 02:48:01,310 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse0 .cse3))) (and (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1)) (not (= .cse1 .cse2))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse1))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse5 .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse1))))))) (= 1 (select |c_#valid| .cse6)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7)) (= (select |c_#valid| .cse7) 1)))) is different from true [2025-01-09 02:48:01,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse4))) (and (not (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse4))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse5 (select .cse6 .cse2))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5)) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse4)) (not (= .cse4 .cse5)))))))) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)))) is different from false [2025-01-09 02:48:01,317 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse4))) (and (not (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse4))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse5 (select .cse6 .cse2))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5)) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|) .cse4)) (not (= .cse4 .cse5)))))))) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)))) is different from true [2025-01-09 02:48:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:01,480 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-01-09 02:48:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:48:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2025-01-09 02:48:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:01,481 INFO L225 Difference]: With dead ends: 40 [2025-01-09 02:48:01,481 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 02:48:01,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=1500, Unknown=10, NotChecked=498, Total=2162 [2025-01-09 02:48:01,483 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:01,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 171 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 452 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2025-01-09 02:48:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 02:48:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-01-09 02:48:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:48:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-01-09 02:48:01,487 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2025-01-09 02:48:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:01,487 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-01-09 02:48:01,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-01-09 02:48:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:48:01,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:01,488 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] [2025-01-09 02:48:01,499 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:48:01,692 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:48:01,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 413788878, now seen corresponding path program 1 times [2025-01-09 02:48:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921589582] [2025-01-09 02:48:01,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:01,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:48:01,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:48:01,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:01,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921589582] [2025-01-09 02:48:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921589582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965186007] [2025-01-09 02:48:02,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:02,805 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:48:02,810 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:48:02,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:48:02,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:48:02,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:02,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-09 02:48:02,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:02,966 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:48:03,062 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 02:48:03,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2025-01-09 02:48:03,189 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 02:48:03,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 02:48:03,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-01-09 02:48:03,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2025-01-09 02:48:07,371 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 199 treesize of output 139 [2025-01-09 02:48:07,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2025-01-09 02:48:07,382 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-01-09 02:48:07,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 65 [2025-01-09 02:48:07,387 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 55 treesize of output 53 [2025-01-09 02:48:07,405 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 16 treesize of output 8 [2025-01-09 02:48:07,498 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2025-01-09 02:48:07,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 171 [2025-01-09 02:48:07,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse1 .cse4))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (let ((.cse3 (= .cse2 .cse0))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse2)) .cse3) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse2 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_4) .cse0 v_arrayElimArr_3) .cse2) .cse4 .cse0) .cse1))) (not .cse3))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse5) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse2)) (= (select .cse6 .cse4) .cse2)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse8 (select .cse9 .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_4) .cse8 v_arrayElimArr_3) .cse2) .cse4 .cse8) .cse9) (= .cse2 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse8 .cse2)))))))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2025-01-09 02:48:07,581 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse1 .cse4))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (let ((.cse3 (= .cse2 .cse0))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse2)) .cse3) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse2 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_4) .cse0 v_arrayElimArr_3) .cse2) .cse4 .cse0) .cse1))) (not .cse3))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse5) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse2)) (= (select .cse6 .cse4) .cse2)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse8 (select .cse9 .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_4) .cse8 v_arrayElimArr_3) .cse2) .cse4 .cse8) .cse9) (= .cse2 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse8 .cse2)))))))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2025-01-09 02:48:07,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse2 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0)) (= (select .cse2 .cse3) .cse0)))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse5 .cse3))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)) (let ((.cse6 (= .cse0 .cse4))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0)) .cse6) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse0 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_4) .cse4 v_arrayElimArr_3) .cse0) .cse3 .cse4) .cse5))) (not .cse6))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse8 (select .cse9 .cse3))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse8 v_arrayElimArr_3) .cse0) .cse3 .cse8) .cse9) (= .cse0 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse8 .cse0)))))))))) is different from false [2025-01-09 02:48:07,646 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse2 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0)) (= (select .cse2 .cse3) .cse0)))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse5 .cse3))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)) (let ((.cse6 (= .cse0 .cse4))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0)) .cse6) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse0 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_4) .cse4 v_arrayElimArr_3) .cse0) .cse3 .cse4) .cse5))) (not .cse6))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse8 (select .cse9 .cse3))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse8 v_arrayElimArr_3) .cse0) .cse3 .cse8) .cse9) (= .cse0 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse8 .cse0)))))))))) is different from true [2025-01-09 02:48:07,671 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 0 case distinctions, treesize of input 445 treesize of output 322 [2025-01-09 02:48:07,675 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 0 case distinctions, treesize of input 329 treesize of output 262 [2025-01-09 02:48:07,728 INFO L349 Elim1Store]: treesize reduction 98, result has 1.0 percent of original size [2025-01-09 02:48:07,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 131 [2025-01-09 02:48:07,736 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2025-01-09 02:48:07,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 134 [2025-01-09 02:48:07,752 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2025-01-09 02:48:07,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 94 [2025-01-09 02:48:07,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 02:48:07,812 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 0 case distinctions, treesize of input 396 treesize of output 289 [2025-01-09 02:48:07,816 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 0 case distinctions, treesize of input 296 treesize of output 237 [2025-01-09 02:48:07,829 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 0 case distinctions, treesize of input 410 treesize of output 295 [2025-01-09 02:48:07,833 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 0 case distinctions, treesize of input 302 treesize of output 243 [2025-01-09 02:48:07,843 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 0 case distinctions, treesize of input 516 treesize of output 369 [2025-01-09 02:48:07,847 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 0 case distinctions, treesize of input 376 treesize of output 297 [2025-01-09 02:48:07,893 INFO L349 Elim1Store]: treesize reduction 89, result has 1.1 percent of original size [2025-01-09 02:48:07,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 174 [2025-01-09 02:48:07,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:48:07,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 281 [2025-01-09 02:48:07,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2025-01-09 02:48:08,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ .cse5 4))) (or (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse0 .cse1)) (exists ((v_arrayElimCell_39 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6))) (and (= (store (select (store .cse2 .cse1 v_ArrVal_703) .cse0) .cse3 .cse1) .cse4) (= (select (select (store .cse2 .cse1 v_DerPreprocessor_7) .cse0) .cse5) .cse1) (= (select v_DerPreprocessor_7 (+ 4 v_arrayElimCell_39)) .cse0)))))) (exists ((v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_8 .cse5))) (let ((.cse8 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse7)) (.cse9 (+ 4 v_arrayElimCell_51))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse7 (store .cse8 .cse9 .cse0)) .cse6 v_ArrVal_703) .cse0) .cse3 .cse6) .cse4) (not (= .cse7 .cse0)) (not (= .cse6 .cse7)) (= .cse6 v_DerPreprocessor_8)))))) (exists ((v_arrayElimCell_51 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse10 (select v_arrayElimArr_3 v_prenex_8)) (.cse13 (+ 4 v_arrayElimCell_51))) (let ((.cse11 (select (select |v_#memory_$Pointer$#1.base_56| .cse10) .cse13)) (.cse16 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_56| .cse10 (select |c_#memory_$Pointer$#1.base| .cse10)) .cse11 (select |c_#memory_$Pointer$#1.base| .cse11)) .cse0 (store (select (let ((.cse12 (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) .cse5 .cse10)))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse13 .cse0))) .cse0) .cse3 .cse11))) (let ((.cse14 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10))) (= .cse14 (let ((.cse15 (select .cse14 .cse13))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10 v_DerPreprocessor_4) .cse15 v_arrayElimArr_3) .cse10) .cse13 .cse15)))) (not (= .cse11 .cse10)) (= .cse16 .cse0) (not (= .cse11 .cse0)) (not (= .cse0 .cse10)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse16 (select |v_#memory_$Pointer$#1.base_56| .cse16)) |v_#memory_$Pointer$#1.base_56|))))) (exists ((v_arrayElimCell_38 Int)) (and (not (= .cse0 v_arrayElimCell_38)) (exists ((|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int)) (let ((.cse19 (+ 4 v_arrayElimCell_39))) (let ((.cse17 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse19))) (and (= (store (store |v_#memory_$Pointer$#1.base_56| .cse17 (select |c_#memory_$Pointer$#1.base| .cse17)) .cse0 (store (select (let ((.cse18 (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) .cse5 v_arrayElimCell_38)))) (store .cse18 v_arrayElimCell_38 (store (select .cse18 v_arrayElimCell_38) .cse19 .cse0))) .cse0) .cse3 .cse17)) |c_#memory_$Pointer$#1.base|) (= .cse17 v_arrayElimCell_38) (exists ((v_prenex_11 Int) (v_prenex_12 (Array Int (Array Int Int)))) (let ((.cse20 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (= (store v_prenex_12 .cse20 (select |v_#memory_$Pointer$#1.base_56| .cse20)) |v_#memory_$Pointer$#1.base_56|) (= .cse20 .cse0) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))))))))))) is different from false [2025-01-09 02:48:08,056 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ .cse5 4))) (or (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse0 .cse1)) (exists ((v_arrayElimCell_39 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6))) (and (= (store (select (store .cse2 .cse1 v_ArrVal_703) .cse0) .cse3 .cse1) .cse4) (= (select (select (store .cse2 .cse1 v_DerPreprocessor_7) .cse0) .cse5) .cse1) (= (select v_DerPreprocessor_7 (+ 4 v_arrayElimCell_39)) .cse0)))))) (exists ((v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_8 .cse5))) (let ((.cse8 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse7)) (.cse9 (+ 4 v_arrayElimCell_51))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse7 (store .cse8 .cse9 .cse0)) .cse6 v_ArrVal_703) .cse0) .cse3 .cse6) .cse4) (not (= .cse7 .cse0)) (not (= .cse6 .cse7)) (= .cse6 v_DerPreprocessor_8)))))) (exists ((v_arrayElimCell_51 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse10 (select v_arrayElimArr_3 v_prenex_8)) (.cse13 (+ 4 v_arrayElimCell_51))) (let ((.cse11 (select (select |v_#memory_$Pointer$#1.base_56| .cse10) .cse13)) (.cse16 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_56| .cse10 (select |c_#memory_$Pointer$#1.base| .cse10)) .cse11 (select |c_#memory_$Pointer$#1.base| .cse11)) .cse0 (store (select (let ((.cse12 (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) .cse5 .cse10)))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse13 .cse0))) .cse0) .cse3 .cse11))) (let ((.cse14 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10))) (= .cse14 (let ((.cse15 (select .cse14 .cse13))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10 v_DerPreprocessor_4) .cse15 v_arrayElimArr_3) .cse10) .cse13 .cse15)))) (not (= .cse11 .cse10)) (= .cse16 .cse0) (not (= .cse11 .cse0)) (not (= .cse0 .cse10)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse16 (select |v_#memory_$Pointer$#1.base_56| .cse16)) |v_#memory_$Pointer$#1.base_56|))))) (exists ((v_arrayElimCell_38 Int)) (and (not (= .cse0 v_arrayElimCell_38)) (exists ((|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int)) (let ((.cse19 (+ 4 v_arrayElimCell_39))) (let ((.cse17 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse19))) (and (= (store (store |v_#memory_$Pointer$#1.base_56| .cse17 (select |c_#memory_$Pointer$#1.base| .cse17)) .cse0 (store (select (let ((.cse18 (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) .cse5 v_arrayElimCell_38)))) (store .cse18 v_arrayElimCell_38 (store (select .cse18 v_arrayElimCell_38) .cse19 .cse0))) .cse0) .cse3 .cse17)) |c_#memory_$Pointer$#1.base|) (= .cse17 v_arrayElimCell_38) (exists ((v_prenex_11 Int) (v_prenex_12 (Array Int (Array Int Int)))) (let ((.cse20 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (= (store v_prenex_12 .cse20 (select |v_#memory_$Pointer$#1.base_56| .cse20)) |v_#memory_$Pointer$#1.base_56|) (= .cse20 .cse0) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))))))))))) is different from true [2025-01-09 02:48:08,103 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 806 treesize of output 686 [2025-01-09 02:48:08,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_51 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse1 v_arrayElimArr_8) .cse2)) (.cse4 (+ 4 v_arrayElimCell_51))) (let ((.cse0 (select .cse3 .cse4))) (and (= v_DerPreprocessor_8 .cse0) (not (= .cse1 .cse0)) (not (= .cse2 .cse1)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse1 v_arrayElimArr_8) .cse2 (store .cse3 .cse4 .cse1)) .cse0 v_prenex_26) .cse1) .cse5 .cse0) .cse6) (not (= .cse2 .cse0))))))) (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse7 (select v_arrayElimArr_3 v_prenex_8)) (.cse10 (+ v_prenex_27 4))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse8 (select (select v_prenex_28 .cse7) .cse10))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store v_prenex_28 .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse8 (select |c_#memory_$Pointer$#1.base| .cse8)) .cse1 (store (select (let ((.cse9 (store v_prenex_28 .cse1 (store (select v_prenex_28 .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse10 .cse1))) .cse1) .cse5 .cse8))) (not (= .cse8 .cse7)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse11 (select v_prenex_28 .cse11))) (= .cse11 .cse1) (let ((.cse13 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7))) (= (let ((.cse12 (select .cse13 .cse10))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 v_DerPreprocessor_4) .cse12 v_arrayElimArr_3) .cse7) .cse10 .cse12)) .cse13)) (not (= .cse8 .cse1)) (not (= .cse1 .cse7)))))) (exists ((v_prenex_11 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int) (v_prenex_12 (Array Int (Array Int Int))) (v_arrayElimCell_38 Int)) (let ((.cse16 (+ 4 v_arrayElimCell_39))) (let ((.cse14 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse16)) (.cse17 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse1 v_arrayElimCell_38)) (= (store (store |v_#memory_$Pointer$#1.base_56| .cse14 (select |c_#memory_$Pointer$#1.base| .cse14)) .cse1 (store (select (let ((.cse15 (store |v_#memory_$Pointer$#1.base_56| .cse1 (store (select |v_#memory_$Pointer$#1.base_56| .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_38)))) (store .cse15 v_arrayElimCell_38 (store (select .cse15 v_arrayElimCell_38) .cse16 .cse1))) .cse1) .cse5 .cse14)) |c_#memory_$Pointer$#1.base|) (= (store v_prenex_12 .cse17 (select |v_#memory_$Pointer$#1.base_56| .cse17)) |v_#memory_$Pointer$#1.base_56|) (= .cse14 v_arrayElimCell_38) (= .cse17 .cse1) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))) (let ((.cse18 (select .cse6 .cse5))) (and (not (= .cse18 .cse1)) (exists ((v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_6))) (and (= (select v_DerPreprocessor_7 (+ v_prenex_25 4)) .cse1) (= .cse18 (select (select (store .cse19 .cse18 v_DerPreprocessor_7) .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (store (select (store .cse19 .cse18 v_ArrVal_703) .cse1) .cse5 .cse18) .cse6)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) is different from false [2025-01-09 02:48:08,473 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_51 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse1 v_arrayElimArr_8) .cse2)) (.cse4 (+ 4 v_arrayElimCell_51))) (let ((.cse0 (select .cse3 .cse4))) (and (= v_DerPreprocessor_8 .cse0) (not (= .cse1 .cse0)) (not (= .cse2 .cse1)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse1 v_arrayElimArr_8) .cse2 (store .cse3 .cse4 .cse1)) .cse0 v_prenex_26) .cse1) .cse5 .cse0) .cse6) (not (= .cse2 .cse0))))))) (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse7 (select v_arrayElimArr_3 v_prenex_8)) (.cse10 (+ v_prenex_27 4))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse8 (select (select v_prenex_28 .cse7) .cse10))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store v_prenex_28 .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse8 (select |c_#memory_$Pointer$#1.base| .cse8)) .cse1 (store (select (let ((.cse9 (store v_prenex_28 .cse1 (store (select v_prenex_28 .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse10 .cse1))) .cse1) .cse5 .cse8))) (not (= .cse8 .cse7)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse11 (select v_prenex_28 .cse11))) (= .cse11 .cse1) (let ((.cse13 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7))) (= (let ((.cse12 (select .cse13 .cse10))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 v_DerPreprocessor_4) .cse12 v_arrayElimArr_3) .cse7) .cse10 .cse12)) .cse13)) (not (= .cse8 .cse1)) (not (= .cse1 .cse7)))))) (exists ((v_prenex_11 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int) (v_prenex_12 (Array Int (Array Int Int))) (v_arrayElimCell_38 Int)) (let ((.cse16 (+ 4 v_arrayElimCell_39))) (let ((.cse14 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse16)) (.cse17 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse1 v_arrayElimCell_38)) (= (store (store |v_#memory_$Pointer$#1.base_56| .cse14 (select |c_#memory_$Pointer$#1.base| .cse14)) .cse1 (store (select (let ((.cse15 (store |v_#memory_$Pointer$#1.base_56| .cse1 (store (select |v_#memory_$Pointer$#1.base_56| .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_38)))) (store .cse15 v_arrayElimCell_38 (store (select .cse15 v_arrayElimCell_38) .cse16 .cse1))) .cse1) .cse5 .cse14)) |c_#memory_$Pointer$#1.base|) (= (store v_prenex_12 .cse17 (select |v_#memory_$Pointer$#1.base_56| .cse17)) |v_#memory_$Pointer$#1.base_56|) (= .cse14 v_arrayElimCell_38) (= .cse17 .cse1) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))) (let ((.cse18 (select .cse6 .cse5))) (and (not (= .cse18 .cse1)) (exists ((v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_6))) (and (= (select v_DerPreprocessor_7 (+ v_prenex_25 4)) .cse1) (= .cse18 (select (select (store .cse19 .cse18 v_DerPreprocessor_7) .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (store (select (store .cse19 .cse18 v_ArrVal_703) .cse1) .cse5 .cse18) .cse6)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) is different from true [2025-01-09 02:48:08,590 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 701 treesize of output 521 [2025-01-09 02:48:08,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:08,708 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 204 treesize of output 194 [2025-01-09 02:48:08,714 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 157 treesize of output 129 [2025-01-09 02:48:08,718 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 139 treesize of output 111 [2025-01-09 02:48:08,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 83 [2025-01-09 02:48:08,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 181 [2025-01-09 02:48:08,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:08,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 02:48:08,810 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 116 treesize of output 92 [2025-01-09 02:48:08,814 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 12 treesize of output 8 [2025-01-09 02:48:08,820 WARN L851 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse2 (select v_arrayElimArr_3 v_prenex_8)) (.cse4 (+ v_prenex_27 4))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse1 (select (select v_prenex_28 .cse2) .cse4))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse0) (not (= .cse1 .cse2)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 (select v_prenex_28 .cse0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (let ((.cse3 (store v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base| (store (select v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| .cse2)))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |c_ULTIMATE.start_main_#t~mem19#1.base|))) |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse2)) (let ((.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (= (let ((.cse5 (select .cse6 .cse4))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_4) .cse5 v_arrayElimArr_3) .cse2) .cse4 .cse5)) .cse6))))))) is different from false [2025-01-09 02:48:08,823 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse2 (select v_arrayElimArr_3 v_prenex_8)) (.cse4 (+ v_prenex_27 4))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse1 (select (select v_prenex_28 .cse2) .cse4))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse0) (not (= .cse1 .cse2)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 (select v_prenex_28 .cse0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (let ((.cse3 (store v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base| (store (select v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| .cse2)))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |c_ULTIMATE.start_main_#t~mem19#1.base|))) |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse2)) (let ((.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (= (let ((.cse5 (select .cse6 .cse4))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_4) .cse5 v_arrayElimArr_3) .cse2) .cse4 .cse5)) .cse6))))))) is different from true [2025-01-09 02:48:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:08,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:08,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (not (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_701) .cse1 v_ArrVal_707) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)))) (store .cse2 .cse0 (store (select .cse2 .cse0) .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))) .cse1 v_ArrVal_703) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse1)))) .cse6) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6))))) is different from false [2025-01-09 02:48:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965186007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:09,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:48:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2025-01-09 02:48:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290702012] [2025-01-09 02:48:09,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:09,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 02:48:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:09,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 02:48:09,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=831, Unknown=33, NotChecked=378, Total=1332 [2025-01-09 02:48:09,127 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 34 states, 32 states have (on average 1.375) internal successors, (44), 27 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:09,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse11) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (let ((.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse2 .cse5))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (let ((.cse4 (= .cse3 .cse1))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3)) .cse4) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse3 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_4) .cse1 v_arrayElimArr_3) .cse3) .cse5 .cse1) .cse2))) (not .cse4))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse6 (select |c_#memory_$Pointer$#1.base| .cse6))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3)) (= (select .cse7 .cse5) .cse3)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse9 (select .cse10 .cse5))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |c_#memory_$Pointer$#1.base| .cse8))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse9)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 v_DerPreprocessor_4) .cse9 v_arrayElimArr_3) .cse3) .cse5 .cse9) .cse10) (= .cse3 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse9 .cse3)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse3)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse11)) (= (select |c_#valid| .cse11) 1)))) is different from false [2025-01-09 02:48:09,639 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse11) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (let ((.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse2 .cse5))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (let ((.cse4 (= .cse3 .cse1))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3)) .cse4) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse3 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_4) .cse1 v_arrayElimArr_3) .cse3) .cse5 .cse1) .cse2))) (not .cse4))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse6 (select |c_#memory_$Pointer$#1.base| .cse6))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3)) (= (select .cse7 .cse5) .cse3)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse9 (select .cse10 .cse5))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |c_#memory_$Pointer$#1.base| .cse8))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse9)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 v_DerPreprocessor_4) .cse9 v_arrayElimArr_3) .cse3) .cse5 .cse9) .cse10) (= .cse3 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse9 .cse3)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse3)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse11)) (= (select |c_#valid| .cse11) 1)))) is different from true [2025-01-09 02:48:09,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse1)) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1)) (= (select .cse3 .cse4) .cse1)))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse5 (select .cse6 .cse4))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5)) (let ((.cse7 (= .cse1 .cse5))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1)) .cse7) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse1 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_4) .cse5 v_arrayElimArr_3) .cse1) .cse4 .cse5) .cse6))) (not .cse7))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse9 (select .cse10 .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |c_#memory_$Pointer$#1.base| .cse8))) (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 v_DerPreprocessor_4) .cse9 v_arrayElimArr_3) .cse1) .cse4 .cse9) .cse10) (= .cse1 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse9 .cse1)))))))))) is different from false [2025-01-09 02:48:09,651 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse1)) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1)) (= (select .cse3 .cse4) .cse1)))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse5 (select .cse6 .cse4))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5)) (let ((.cse7 (= .cse1 .cse5))) (or (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1)) .cse7) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= .cse1 (select v_arrayElimArr_3 v_prenex_8)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_4) .cse5 v_arrayElimArr_3) .cse1) .cse4 .cse5) .cse6))) (not .cse7))))))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse9 (select .cse10 .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |c_#memory_$Pointer$#1.base| .cse8))) (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_8 Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 v_DerPreprocessor_4) .cse9 v_arrayElimArr_3) .cse1) .cse4 .cse9) .cse10) (= .cse1 (select v_arrayElimArr_3 v_prenex_8)))) (not (= .cse9 .cse1)))))))))) is different from true [2025-01-09 02:48:10,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select .cse0 .cse1) .cse2)) (let ((.cse5 (+ .cse1 4))) (or (let ((.cse3 (select .cse0 .cse5))) (and (not (= .cse2 .cse3)) (exists ((v_arrayElimCell_39 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_6))) (and (= (store (select (store .cse4 .cse3 v_ArrVal_703) .cse2) .cse5 .cse3) .cse0) (= (select (select (store .cse4 .cse3 v_DerPreprocessor_7) .cse2) .cse1) .cse3) (= (select v_DerPreprocessor_7 (+ 4 v_arrayElimCell_39)) .cse2)))))) (exists ((v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_8 .cse1))) (let ((.cse8 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse2 v_arrayElimArr_8) .cse7)) (.cse9 (+ 4 v_arrayElimCell_51))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 .cse2)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse2 v_arrayElimArr_8) .cse7 (store .cse8 .cse9 .cse2)) .cse6 v_ArrVal_703) .cse2) .cse5 .cse6) .cse0) (not (= .cse7 .cse2)) (not (= .cse6 .cse7)) (= .cse6 v_DerPreprocessor_8)))))) (exists ((v_arrayElimCell_51 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse10 (select v_arrayElimArr_3 v_prenex_8)) (.cse13 (+ 4 v_arrayElimCell_51))) (let ((.cse11 (select (select |v_#memory_$Pointer$#1.base_56| .cse10) .cse13)) (.cse16 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_56| .cse10 (select |c_#memory_$Pointer$#1.base| .cse10)) .cse11 (select |c_#memory_$Pointer$#1.base| .cse11)) .cse2 (store (select (let ((.cse12 (store |v_#memory_$Pointer$#1.base_56| .cse2 (store (select |v_#memory_$Pointer$#1.base_56| .cse2) .cse1 .cse10)))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse13 .cse2))) .cse2) .cse5 .cse11))) (let ((.cse14 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10))) (= .cse14 (let ((.cse15 (select .cse14 .cse13))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10 v_DerPreprocessor_4) .cse15 v_arrayElimArr_3) .cse10) .cse13 .cse15)))) (not (= .cse11 .cse10)) (= .cse16 .cse2) (not (= .cse11 .cse2)) (not (= .cse2 .cse10)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse16 (select |v_#memory_$Pointer$#1.base_56| .cse16)) |v_#memory_$Pointer$#1.base_56|))))) (exists ((v_arrayElimCell_38 Int)) (and (not (= .cse2 v_arrayElimCell_38)) (exists ((|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int)) (let ((.cse19 (+ 4 v_arrayElimCell_39))) (let ((.cse17 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse19))) (and (= (store (store |v_#memory_$Pointer$#1.base_56| .cse17 (select |c_#memory_$Pointer$#1.base| .cse17)) .cse2 (store (select (let ((.cse18 (store |v_#memory_$Pointer$#1.base_56| .cse2 (store (select |v_#memory_$Pointer$#1.base_56| .cse2) .cse1 v_arrayElimCell_38)))) (store .cse18 v_arrayElimCell_38 (store (select .cse18 v_arrayElimCell_38) .cse19 .cse2))) .cse2) .cse5 .cse17)) |c_#memory_$Pointer$#1.base|) (= .cse17 v_arrayElimCell_38) (exists ((v_prenex_11 Int) (v_prenex_12 (Array Int (Array Int Int)))) (let ((.cse20 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (= (store v_prenex_12 .cse20 (select |v_#memory_$Pointer$#1.base_56| .cse20)) |v_#memory_$Pointer$#1.base_56|) (= .cse20 .cse2) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))))))))))))) is different from false [2025-01-09 02:48:10,347 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select .cse0 .cse1) .cse2)) (let ((.cse5 (+ .cse1 4))) (or (let ((.cse3 (select .cse0 .cse5))) (and (not (= .cse2 .cse3)) (exists ((v_arrayElimCell_39 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_6))) (and (= (store (select (store .cse4 .cse3 v_ArrVal_703) .cse2) .cse5 .cse3) .cse0) (= (select (select (store .cse4 .cse3 v_DerPreprocessor_7) .cse2) .cse1) .cse3) (= (select v_DerPreprocessor_7 (+ 4 v_arrayElimCell_39)) .cse2)))))) (exists ((v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_8 .cse1))) (let ((.cse8 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse2 v_arrayElimArr_8) .cse7)) (.cse9 (+ 4 v_arrayElimCell_51))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 .cse2)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse2 v_arrayElimArr_8) .cse7 (store .cse8 .cse9 .cse2)) .cse6 v_ArrVal_703) .cse2) .cse5 .cse6) .cse0) (not (= .cse7 .cse2)) (not (= .cse6 .cse7)) (= .cse6 v_DerPreprocessor_8)))))) (exists ((v_arrayElimCell_51 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse10 (select v_arrayElimArr_3 v_prenex_8)) (.cse13 (+ 4 v_arrayElimCell_51))) (let ((.cse11 (select (select |v_#memory_$Pointer$#1.base_56| .cse10) .cse13)) (.cse16 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_56| .cse10 (select |c_#memory_$Pointer$#1.base| .cse10)) .cse11 (select |c_#memory_$Pointer$#1.base| .cse11)) .cse2 (store (select (let ((.cse12 (store |v_#memory_$Pointer$#1.base_56| .cse2 (store (select |v_#memory_$Pointer$#1.base_56| .cse2) .cse1 .cse10)))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse13 .cse2))) .cse2) .cse5 .cse11))) (let ((.cse14 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10))) (= .cse14 (let ((.cse15 (select .cse14 .cse13))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse10 v_DerPreprocessor_4) .cse15 v_arrayElimArr_3) .cse10) .cse13 .cse15)))) (not (= .cse11 .cse10)) (= .cse16 .cse2) (not (= .cse11 .cse2)) (not (= .cse2 .cse10)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse16 (select |v_#memory_$Pointer$#1.base_56| .cse16)) |v_#memory_$Pointer$#1.base_56|))))) (exists ((v_arrayElimCell_38 Int)) (and (not (= .cse2 v_arrayElimCell_38)) (exists ((|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int)) (let ((.cse19 (+ 4 v_arrayElimCell_39))) (let ((.cse17 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse19))) (and (= (store (store |v_#memory_$Pointer$#1.base_56| .cse17 (select |c_#memory_$Pointer$#1.base| .cse17)) .cse2 (store (select (let ((.cse18 (store |v_#memory_$Pointer$#1.base_56| .cse2 (store (select |v_#memory_$Pointer$#1.base_56| .cse2) .cse1 v_arrayElimCell_38)))) (store .cse18 v_arrayElimCell_38 (store (select .cse18 v_arrayElimCell_38) .cse19 .cse2))) .cse2) .cse5 .cse17)) |c_#memory_$Pointer$#1.base|) (= .cse17 v_arrayElimCell_38) (exists ((v_prenex_11 Int) (v_prenex_12 (Array Int (Array Int Int)))) (let ((.cse20 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (= (store v_prenex_12 .cse20 (select |v_#memory_$Pointer$#1.base_56| .cse20)) |v_#memory_$Pointer$#1.base_56|) (= .cse20 .cse2) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))))))))))))) is different from true [2025-01-09 02:48:10,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse0)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_51 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse2)) (.cse4 (+ 4 v_arrayElimCell_51))) (let ((.cse1 (select .cse3 .cse4))) (and (= v_DerPreprocessor_8 .cse1) (not (= .cse0 .cse1)) (not (= .cse2 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse2 (store .cse3 .cse4 .cse0)) .cse1 v_prenex_26) .cse0) .cse5 .cse1) .cse6) (not (= .cse2 .cse1))))))) (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse7 (select v_arrayElimArr_3 v_prenex_8)) (.cse10 (+ v_prenex_27 4))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse8 (select (select v_prenex_28 .cse7) .cse10))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store v_prenex_28 .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse8 (select |c_#memory_$Pointer$#1.base| .cse8)) .cse0 (store (select (let ((.cse9 (store v_prenex_28 .cse0 (store (select v_prenex_28 .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse10 .cse0))) .cse0) .cse5 .cse8))) (not (= .cse8 .cse7)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse11 (select v_prenex_28 .cse11))) (= .cse11 .cse0) (let ((.cse13 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7))) (= (let ((.cse12 (select .cse13 .cse10))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 v_DerPreprocessor_4) .cse12 v_arrayElimArr_3) .cse7) .cse10 .cse12)) .cse13)) (not (= .cse8 .cse0)) (not (= .cse0 .cse7)))))) (exists ((v_prenex_11 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int) (v_prenex_12 (Array Int (Array Int Int))) (v_arrayElimCell_38 Int)) (let ((.cse16 (+ 4 v_arrayElimCell_39))) (let ((.cse14 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse16)) (.cse17 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse0 v_arrayElimCell_38)) (= (store (store |v_#memory_$Pointer$#1.base_56| .cse14 (select |c_#memory_$Pointer$#1.base| .cse14)) .cse0 (store (select (let ((.cse15 (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_38)))) (store .cse15 v_arrayElimCell_38 (store (select .cse15 v_arrayElimCell_38) .cse16 .cse0))) .cse0) .cse5 .cse14)) |c_#memory_$Pointer$#1.base|) (= (store v_prenex_12 .cse17 (select |v_#memory_$Pointer$#1.base_56| .cse17)) |v_#memory_$Pointer$#1.base_56|) (= .cse14 v_arrayElimCell_38) (= .cse17 .cse0) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))) (let ((.cse18 (select .cse6 .cse5))) (and (not (= .cse18 .cse0)) (exists ((v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6))) (and (= (select v_DerPreprocessor_7 (+ v_prenex_25 4)) .cse0) (= .cse18 (select (select (store .cse19 .cse18 v_DerPreprocessor_7) .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (store (select (store .cse19 .cse18 v_ArrVal_703) .cse0) .cse5 .cse18) .cse6)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))) is different from false [2025-01-09 02:48:10,474 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse0)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_51 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse2)) (.cse4 (+ 4 v_arrayElimCell_51))) (let ((.cse1 (select .cse3 .cse4))) (and (= v_DerPreprocessor_8 .cse1) (not (= .cse0 .cse1)) (not (= .cse2 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_arrayElimArr_8) .cse2 (store .cse3 .cse4 .cse0)) .cse1 v_prenex_26) .cse0) .cse5 .cse1) .cse6) (not (= .cse2 .cse1))))))) (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse7 (select v_arrayElimArr_3 v_prenex_8)) (.cse10 (+ v_prenex_27 4))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse8 (select (select v_prenex_28 .cse7) .cse10))) (and (= |c_#memory_$Pointer$#1.base| (store (store (store v_prenex_28 .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse8 (select |c_#memory_$Pointer$#1.base| .cse8)) .cse0 (store (select (let ((.cse9 (store v_prenex_28 .cse0 (store (select v_prenex_28 .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse7)))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse10 .cse0))) .cse0) .cse5 .cse8))) (not (= .cse8 .cse7)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse11 (select v_prenex_28 .cse11))) (= .cse11 .cse0) (let ((.cse13 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7))) (= (let ((.cse12 (select .cse13 .cse10))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse7 v_DerPreprocessor_4) .cse12 v_arrayElimArr_3) .cse7) .cse10 .cse12)) .cse13)) (not (= .cse8 .cse0)) (not (= .cse0 .cse7)))))) (exists ((v_prenex_11 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_arrayElimCell_39 Int) (v_prenex_12 (Array Int (Array Int Int))) (v_arrayElimCell_38 Int)) (let ((.cse16 (+ 4 v_arrayElimCell_39))) (let ((.cse14 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_38) .cse16)) (.cse17 (@diff v_prenex_12 |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse0 v_arrayElimCell_38)) (= (store (store |v_#memory_$Pointer$#1.base_56| .cse14 (select |c_#memory_$Pointer$#1.base| .cse14)) .cse0 (store (select (let ((.cse15 (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_38)))) (store .cse15 v_arrayElimCell_38 (store (select .cse15 v_arrayElimCell_38) .cse16 .cse0))) .cse0) .cse5 .cse14)) |c_#memory_$Pointer$#1.base|) (= (store v_prenex_12 .cse17 (select |v_#memory_$Pointer$#1.base_56| .cse17)) |v_#memory_$Pointer$#1.base_56|) (= .cse14 v_arrayElimCell_38) (= .cse17 .cse0) (= (select (select v_prenex_12 v_arrayElimCell_38) v_prenex_11) v_arrayElimCell_38))))) (let ((.cse18 (select .cse6 .cse5))) (and (not (= .cse18 .cse0)) (exists ((v_ArrVal_703 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6))) (and (= (select v_DerPreprocessor_7 (+ v_prenex_25 4)) .cse0) (= .cse18 (select (select (store .cse19 .cse18 v_DerPreprocessor_7) .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (store (select (store .cse19 .cse18 v_ArrVal_703) .cse0) .cse5 .cse18) .cse6)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))) is different from true [2025-01-09 02:48:10,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (and .cse0 (or .cse0 (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse3 (select v_arrayElimArr_3 v_prenex_8)) (.cse5 (+ v_prenex_27 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse2 (select (select v_prenex_28 .cse3) .cse5))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1) (not (= .cse2 .cse3)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select v_prenex_28 .cse1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (let ((.cse4 (store v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base| (store (select v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| .cse3)))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 |c_ULTIMATE.start_main_#t~mem19#1.base|))) |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse2)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse3)) (let ((.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (= (let ((.cse6 (select .cse7 .cse5))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 v_DerPreprocessor_4) .cse6 v_arrayElimArr_3) .cse3) .cse5 .cse6)) .cse7))))))))) is different from false [2025-01-09 02:48:10,480 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (and .cse0 (or .cse0 (exists ((v_prenex_27 Int) (v_prenex_28 (Array Int (Array Int Int))) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_prenex_8 Int)) (let ((.cse3 (select v_arrayElimArr_3 v_prenex_8)) (.cse5 (+ v_prenex_27 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_prenex_28)) (.cse2 (select (select v_prenex_28 .cse3) .cse5))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1) (not (= .cse2 .cse3)) (= v_prenex_28 (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select v_prenex_28 .cse1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (let ((.cse4 (store v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base| (store (select v_prenex_28 |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| .cse3)))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 |c_ULTIMATE.start_main_#t~mem19#1.base|))) |c_ULTIMATE.start_main_#t~mem19#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse2)) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse3)) (let ((.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (= (let ((.cse6 (select .cse7 .cse5))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 v_DerPreprocessor_4) .cse6 v_arrayElimArr_3) .cse3) .cse5 .cse6)) .cse7))))))))) is different from true [2025-01-09 02:48:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:10,609 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-01-09 02:48:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:48:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.375) internal successors, (44), 27 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2025-01-09 02:48:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:10,610 INFO L225 Difference]: With dead ends: 40 [2025-01-09 02:48:10,611 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:48:10,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=149, Invalid=1331, Unknown=46, NotChecked=924, Total=2450 [2025-01-09 02:48:10,612 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:10,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 261 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 455 Invalid, 1 Unknown, 347 Unchecked, 0.4s Time] [2025-01-09 02:48:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:48:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 02:48:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:48:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-09 02:48:10,616 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2025-01-09 02:48:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:10,616 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-09 02:48:10,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.375) internal successors, (44), 27 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-09 02:48:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:48:10,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:10,617 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] [2025-01-09 02:48:10,625 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:48:10,817 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:48:10,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -57523482, now seen corresponding path program 1 times [2025-01-09 02:48:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958156271] [2025-01-09 02:48:10,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:48:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:48:10,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958156271] [2025-01-09 02:48:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958156271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858388011] [2025-01-09 02:48:12,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:12,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:12,901 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:48:12,901 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:48:12,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:48:13,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:48:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:13,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-01-09 02:48:13,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:13,097 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:48:13,295 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:48:13,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:48:13,366 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:48:13,435 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:48:13,483 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:48:13,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:13,598 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 26 treesize of output 23 [2025-01-09 02:48:13,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-01-09 02:48:13,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-01-09 02:48:13,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-01-09 02:48:13,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-01-09 02:48:13,740 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:48:13,745 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:48:13,748 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:48:13,988 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:48:13,988 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:48:14,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:14,001 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:48:14,017 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:48:14,018 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:48:14,221 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-01-09 02:48:14,221 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-01-09 02:48:14,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 99 [2025-01-09 02:48:14,240 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 0 case distinctions, treesize of input 357 treesize of output 242 [2025-01-09 02:48:14,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:14,248 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 45 treesize of output 47 [2025-01-09 02:48:14,260 INFO L349 Elim1Store]: treesize reduction 73, result has 1.4 percent of original size [2025-01-09 02:48:14,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 223 [2025-01-09 02:48:14,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2025-01-09 02:48:14,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 02:48:14,286 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 73 treesize of output 13 [2025-01-09 02:48:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:14,686 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 312 treesize of output 282 [2025-01-09 02:48:14,695 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 252 treesize of output 184 [2025-01-09 02:48:14,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:14,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:14,708 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 72 treesize of output 58 [2025-01-09 02:48:14,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2025-01-09 02:48:14,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 204 [2025-01-09 02:48:14,734 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 119 treesize of output 105 [2025-01-09 02:48:14,743 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 173 treesize of output 155 [2025-01-09 02:48:14,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2025-01-09 02:48:14,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2025-01-09 02:48:14,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 02:48:14,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 16 treesize of output 5 [2025-01-09 02:48:14,845 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 35 treesize of output 23 [2025-01-09 02:48:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:15,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:15,201 INFO L349 Elim1Store]: treesize reduction 67, result has 54.1 percent of original size [2025-01-09 02:48:15,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 5927 treesize of output 5701 [2025-01-09 02:48:15,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:15,233 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 6417 treesize of output 6405 [2025-01-09 02:48:15,256 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 8515 treesize of output 8291 [2025-01-09 02:48:15,277 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 9387 treesize of output 9275 [2025-01-09 02:48:15,308 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 5565 treesize of output 5537 [2025-01-09 02:48:15,338 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 5564 treesize of output 5508 [2025-01-09 02:48:15,384 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 18 treesize of output 4