./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_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/sll2n_append_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:49:50,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:49:50,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:49:50,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:49:50,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:49:50,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:49:50,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:49:50,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:49:50,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:49:50,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:49:50,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:49:50,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:49:50,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:49:50,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:49:50,210 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:49:50,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:49:50,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:49:50,210 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:49:50,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:49:50,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:49:50,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:49:50,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:49:50,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:49:50,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:50,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:50,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:50,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:49:50,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:49:50,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:49:50,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:49:50,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:49:50,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:49:50,215 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2025-01-09 02:49:50,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:49:50,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:49:50,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:49:50,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:49:50,457 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:49:50,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-01-09 02:49:51,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834078d38/932a0754f3a24d52b044cbfa811f75f2/FLAG11fd3dc00 [2025-01-09 02:49:52,030 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:49:52,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-01-09 02:49:52,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834078d38/932a0754f3a24d52b044cbfa811f75f2/FLAG11fd3dc00 [2025-01-09 02:49:52,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834078d38/932a0754f3a24d52b044cbfa811f75f2 [2025-01-09 02:49:52,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:49:52,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:49:52,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:52,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:49:52,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:49:52,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51eb19c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52, skipping insertion in model container [2025-01-09 02:49:52,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:49:52,505 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/sll2n_append_equal.i[24197,24210] [2025-01-09 02:49:52,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:52,513 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:49:52,535 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/sll2n_append_equal.i[24197,24210] [2025-01-09 02:49:52,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:52,553 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:49:52,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52 WrapperNode [2025-01-09 02:49:52,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:52,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:52,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:49:52,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:49:52,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,576 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2025-01-09 02:49:52,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:52,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:49:52,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:49:52,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:49:52,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,599 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2025-01-09 02:49:52,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:49:52,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:49:52,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:49:52,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:49:52,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (1/1) ... [2025-01-09 02:49:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:52,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:52,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:49:52,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:49:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:49:52,653 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:49:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:49:52,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:49:52,733 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:49:52,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:49:52,837 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-01-09 02:49:52,838 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:49:52,843 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:49:52,844 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:49:52,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:52 BoogieIcfgContainer [2025-01-09 02:49:52,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:49:52,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:49:52,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:49:52,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:49:52,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:49:52" (1/3) ... [2025-01-09 02:49:52,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504946ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:52, skipping insertion in model container [2025-01-09 02:49:52,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:52" (2/3) ... [2025-01-09 02:49:52,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504946ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:52, skipping insertion in model container [2025-01-09 02:49:52,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:52" (3/3) ... [2025-01-09 02:49:52,851 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2025-01-09 02:49:52,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:49:52,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 02:49:52,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:49:52,899 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;@4e855ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:49:52,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:49:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:49:52,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:52,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:52,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 706842905, now seen corresponding path program 1 times [2025-01-09 02:49:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114988932] [2025-01-09 02:49:52,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:52,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:49:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:49:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114988932] [2025-01-09 02:49:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114988932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:49:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630273952] [2025-01-09 02:49:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:49:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:53,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:49:53,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:53,129 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:49:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:53,149 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2025-01-09 02:49:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:49:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-09 02:49:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:53,154 INFO L225 Difference]: With dead ends: 58 [2025-01-09 02:49:53,154 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 02:49:53,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:53,158 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:53,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 02:49:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-01-09 02:49:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-01-09 02:49:53,180 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2025-01-09 02:49:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:53,180 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-01-09 02:49:53,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:49:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-01-09 02:49:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:49:53,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:53,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:53,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:49:53,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:53,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1963751233, now seen corresponding path program 1 times [2025-01-09 02:49:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145041131] [2025-01-09 02:49:53,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:53,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:49:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:49:53,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:49:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145041131] [2025-01-09 02:49:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145041131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270829786] [2025-01-09 02:49:53,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:53,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:53,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:53,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:49:53,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:49:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:49:53,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:53,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:53,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:49:53,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:53,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:49:53,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270829786] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:53,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:53,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 02:49:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059527826] [2025-01-09 02:49:53,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:53,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:49:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:53,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:49:53,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:49:53,533 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:49:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:53,551 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-01-09 02:49:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:49:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-01-09 02:49:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:53,552 INFO L225 Difference]: With dead ends: 47 [2025-01-09 02:49:53,552 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 02:49:53,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:49:53,553 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:53,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 02:49:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 02:49:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-01-09 02:49:53,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2025-01-09 02:49:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:53,556 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-01-09 02:49:53,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:49:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-01-09 02:49:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:49:53,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:53,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:53,564 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:49:53,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:53,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash -597510807, now seen corresponding path program 2 times [2025-01-09 02:49:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:53,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936476556] [2025-01-09 02:49:53,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:53,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 02:49:53,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 32 statements. [2025-01-09 02:49:53,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 02:49:53,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:49:54,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:54,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936476556] [2025-01-09 02:49:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936476556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:54,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:49:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488430860] [2025-01-09 02:49:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:54,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:49:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:54,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:49:54,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:49:54,268 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:54,396 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-01-09 02:49:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:49:54,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-01-09 02:49:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:54,397 INFO L225 Difference]: With dead ends: 38 [2025-01-09 02:49:54,397 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 02:49:54,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:49:54,398 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:54,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 133 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:49:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 02:49:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-01-09 02:49:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-01-09 02:49:54,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 32 [2025-01-09 02:49:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:54,402 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-01-09 02:49:54,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-01-09 02:49:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:49:54,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:54,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:54,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:49:54,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:54,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash -597503863, now seen corresponding path program 1 times [2025-01-09 02:49:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688536130] [2025-01-09 02:49:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:49:54,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:49:54,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:54,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:49:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688536130] [2025-01-09 02:49:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688536130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013505370] [2025-01-09 02:49:54,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:54,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:54,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:54,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:49:54,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:49:54,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:49:54,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:54,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:54,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 02:49:54,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:55,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:49:55,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:49:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:49:55,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:49:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013505370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:49:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2025-01-09 02:49:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938232612] [2025-01-09 02:49:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:49:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:55,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:49:55,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-01-09 02:49:55,065 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:55,118 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-01-09 02:49:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:49:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-01-09 02:49:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:55,119 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:49:55,119 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 02:49:55,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-01-09 02:49:55,120 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:55,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 02:49:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-01-09 02:49:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-01-09 02:49:55,126 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 32 [2025-01-09 02:49:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:55,126 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-01-09 02:49:55,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-01-09 02:49:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:49:55,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:55,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:55,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:49:55,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:55,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1317771972, now seen corresponding path program 1 times [2025-01-09 02:49:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576644927] [2025-01-09 02:49:55,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:55,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:49:55,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:55,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:55,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 02:49:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576644927] [2025-01-09 02:49:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576644927] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654634529] [2025-01-09 02:49:55,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:55,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:55,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:55,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:55,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:49:55,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:49:55,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:55,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:55,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:55,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-01-09 02:49:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:55,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:55,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:55,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:49:55,993 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:49:55,994 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:49:56,029 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:56,029 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 17 treesize of output 21 [2025-01-09 02:49:56,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:56,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:49:56,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:49:56,324 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 45 treesize of output 21 [2025-01-09 02:49:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:56,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:56,345 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 7 treesize of output 3 [2025-01-09 02:50:01,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:01,454 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 53 treesize of output 36 [2025-01-09 02:50:01,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:01,476 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 24 treesize of output 19 [2025-01-09 02:50:01,523 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:50:01,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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:50:01,535 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 20 treesize of output 15 [2025-01-09 02:50:02,263 INFO L349 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2025-01-09 02:50:02,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 65 [2025-01-09 02:50:02,410 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-01-09 02:50:02,410 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 2 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 02:50:07,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:07,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 125 [2025-01-09 02:50:07,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:07,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 151 [2025-01-09 02:50:11,882 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 27 treesize of output 15 [2025-01-09 02:50:11,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:50:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:50:12,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:14,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654634529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:14,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 31 [2025-01-09 02:50:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558639181] [2025-01-09 02:50:14,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:14,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:50:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:14,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:50:14,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1383, Unknown=2, NotChecked=0, Total=1482 [2025-01-09 02:50:14,199 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 25 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:50:21,573 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:50:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:22,989 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-01-09 02:50:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:50:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 25 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2025-01-09 02:50:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:22,991 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:50:22,991 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 02:50:22,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=180, Invalid=2368, Unknown=2, NotChecked=0, Total=2550 [2025-01-09 02:50:22,993 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:22,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 405 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 512 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 02:50:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 02:50:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-01-09 02:50:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-01-09 02:50:23,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 34 [2025-01-09 02:50:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:23,004 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-01-09 02:50:23,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 25 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:50:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-01-09 02:50:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:50:23,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:23,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:23,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:23,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:23,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:23,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1914565536, now seen corresponding path program 1 times [2025-01-09 02:50:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736159843] [2025-01-09 02:50:23,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:23,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:50:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:50:23,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:24,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736159843] [2025-01-09 02:50:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736159843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705413091] [2025-01-09 02:50:24,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:24,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:24,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:24,853 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:50:24,855 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:50:24,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:50:25,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:50:25,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:25,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:25,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-09 02:50:25,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:25,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:50:25,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-01-09 02:50:25,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:25,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:50:25,594 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 23 treesize of output 3 [2025-01-09 02:50:25,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:50:25,908 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 9 treesize of output 3 [2025-01-09 02:50:26,170 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_22| Int)) (and (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_22| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_22|)) |c_#memory_int#2|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_22|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_22| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_22|)) |c_#memory_$Pointer$#2.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2025-01-09 02:50:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:50:26,264 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:50:26,264 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 15 treesize of output 15 [2025-01-09 02:50:26,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:50:26,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:50:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-01-09 02:50:26,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705413091] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:27,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2025-01-09 02:50:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260134674] [2025-01-09 02:50:27,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:27,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:50:27,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:27,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:50:27,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=956, Unknown=1, NotChecked=62, Total=1122 [2025-01-09 02:50:27,561 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 31 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:50:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:29,100 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-01-09 02:50:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:50:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-01-09 02:50:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:29,101 INFO L225 Difference]: With dead ends: 47 [2025-01-09 02:50:29,101 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 02:50:29,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=1646, Unknown=1, NotChecked=82, Total=1892 [2025-01-09 02:50:29,102 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:29,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 181 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 48 Unchecked, 0.9s Time] [2025-01-09 02:50:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 02:50:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2025-01-09 02:50:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-01-09 02:50:29,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 35 [2025-01-09 02:50:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:29,106 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-01-09 02:50:29,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:50:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-01-09 02:50:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:50:29,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:29,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:29,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 02:50:29,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 02:50:29,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:29,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1914558592, now seen corresponding path program 1 times [2025-01-09 02:50:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:29,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184835417] [2025-01-09 02:50:29,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:29,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:50:29,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:50:29,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:29,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:50:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:29,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184835417] [2025-01-09 02:50:29,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184835417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:29,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744291332] [2025-01-09 02:50:29,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:29,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:29,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:29,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:29,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:50:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:50:29,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:50:29,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:29,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:29,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 02:50:29,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:29,786 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:50:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:29,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:50:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744291332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:50:29,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:50:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-01-09 02:50:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298350122] [2025-01-09 02:50:29,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:29,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:50:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:29,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:50:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:50:29,907 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:33,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:50:37,975 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:50:42,023 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:50:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:42,435 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-01-09 02:50:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:50:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-01-09 02:50:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:42,438 INFO L225 Difference]: With dead ends: 43 [2025-01-09 02:50:42,438 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 02:50:42,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:50:42,439 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:42,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 168 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-01-09 02:50:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 02:50:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 02:50:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-01-09 02:50:42,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 35 [2025-01-09 02:50:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:42,459 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-01-09 02:50:42,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-01-09 02:50:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 02:50:42,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:42,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:42,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:42,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:42,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:42,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1651437573, now seen corresponding path program 1 times [2025-01-09 02:50:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:42,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965308820] [2025-01-09 02:50:42,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:50:42,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:50:42,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:42,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:50:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965308820] [2025-01-09 02:50:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965308820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145208344] [2025-01-09 02:50:44,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:44,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:44,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:44,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:44,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:50:44,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:50:44,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:50:44,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:44,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:44,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 166 conjuncts are in the unsatisfiable core [2025-01-09 02:50:44,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:44,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:50:44,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:45,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:50:46,079 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:50:46,079 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:50:46,118 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:50:46,151 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:50:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:50:46,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:50:46,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 02:50:47,377 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 60 treesize of output 28 [2025-01-09 02:50:47,390 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:50:47,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 02:50:47,415 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 7 treesize of output 3 [2025-01-09 02:50:47,787 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 9 treesize of output 12 [2025-01-09 02:50:48,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:48,015 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 68 treesize of output 45 [2025-01-09 02:50:48,081 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-01-09 02:50:48,081 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 2 case distinctions, treesize of input 35 treesize of output 53 [2025-01-09 02:50:48,157 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-01-09 02:50:48,157 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 1 case distinctions, treesize of input 24 treesize of output 31 [2025-01-09 02:50:48,201 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:50:48,201 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:50:49,088 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 94 treesize of output 35 [2025-01-09 02:50:49,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 29 [2025-01-09 02:50:49,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-01-09 02:50:49,382 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 70 treesize of output 42 [2025-01-09 02:50:49,737 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 35 treesize of output 19 [2025-01-09 02:50:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:50:50,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:53,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:53,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 170 [2025-01-09 02:50:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145208344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:53,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 41 [2025-01-09 02:50:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280258830] [2025-01-09 02:50:53,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 02:50:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 02:50:53,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2325, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 02:50:53,566 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:58,197 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-01-09 02:50:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:50:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-01-09 02:50:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:58,200 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:50:58,200 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:50:58,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 02:50:58,203 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:58,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 482 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 02:50:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:50:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-01-09 02:50:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:50:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-09 02:50:58,218 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2025-01-09 02:50:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:58,220 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-09 02:50:58,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-09 02:50:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:50:58,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:58,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:58,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 02:50:58,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2017766707, now seen corresponding path program 1 times [2025-01-09 02:50:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085486042] [2025-01-09 02:50:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:50:58,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:50:58,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:58,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:50:59,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085486042] [2025-01-09 02:50:59,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085486042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323049715] [2025-01-09 02:50:59,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:50:59,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:59,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:59,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 02:50:59,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:50:59,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:50:59,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:50:59,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:59,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-01-09 02:50:59,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:00,021 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:51:00,037 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:51:00,120 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:51:00,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:51:00,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:51:00,347 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 9 treesize of output 3 [2025-01-09 02:51:00,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:51:00,506 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_49| Int)) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_49|))) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_49|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_49|) 0))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-01-09 02:51:00,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:00,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:51:00,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:00,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:51:00,560 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:51:00,560 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 15 treesize of output 15 [2025-01-09 02:51:00,912 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-01-09 02:51:00,912 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 27 treesize of output 23 [2025-01-09 02:51:00,919 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:51:00,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:51:00,997 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:51:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 02:51:01,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:51:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323049715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:01,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:51:01,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 40 [2025-01-09 02:51:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054506720] [2025-01-09 02:51:01,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:51:01,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 02:51:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:01,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 02:51:01,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1657, Unknown=1, NotChecked=82, Total=1892 [2025-01-09 02:51:01,615 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 40 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:03,192 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-01-09 02:51:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:51:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-01-09 02:51:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:03,193 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:51:03,193 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:51:03,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=225, Invalid=2534, Unknown=1, NotChecked=102, Total=2862 [2025-01-09 02:51:03,194 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:03,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 241 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 50 Unchecked, 0.6s Time] [2025-01-09 02:51:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:51:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-01-09 02:51:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:51:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-01-09 02:51:03,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 38 [2025-01-09 02:51:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:03,207 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-01-09 02:51:03,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-01-09 02:51:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 02:51:03,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:03,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:03,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 02:51:03,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:03,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:03,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2043515096, now seen corresponding path program 1 times [2025-01-09 02:51:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:03,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708849046] [2025-01-09 02:51:03,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:03,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 02:51:03,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 02:51:03,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:03,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708849046] [2025-01-09 02:51:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708849046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935370075] [2025-01-09 02:51:05,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:05,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:05,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:51:05,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 02:51:05,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 02:51:05,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 02:51:05,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:05,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:05,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-01-09 02:51:05,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:05,613 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 6 treesize of output 5 [2025-01-09 02:51:05,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:51:06,055 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:51:06,485 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_14| |c_#memory_int#2|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1) (= (select (select |v_#memory_int#2_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_14| .cse1 (select |c_#memory_int#2| .cse1))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2025-01-09 02:51:06,493 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_14| |c_#memory_int#2|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1) (= (select (select |v_#memory_int#2_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_14| .cse1 (select |c_#memory_int#2| .cse1))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2025-01-09 02:51:06,578 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:51:06,578 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:51:06,611 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:51:06,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:51:06,673 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2025-01-09 02:51:06,679 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2025-01-09 02:51:06,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)))) is different from false [2025-01-09 02:51:06,778 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)))) is different from true [2025-01-09 02:51:06,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:51:06,910 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:51:06,936 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 57 treesize of output 25 [2025-01-09 02:51:06,947 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 15 treesize of output 11 [2025-01-09 02:51:06,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:51:07,045 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:51:07,053 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:51:07,146 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:51:07,154 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:51:07,329 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_58| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_58|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_58|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_58|))))) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from false [2025-01-09 02:51:07,335 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_58| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_58|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_58|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_58|))))) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from true [2025-01-09 02:51:07,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:07,536 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 65 treesize of output 42 [2025-01-09 02:51:07,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:07,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:51:07,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:07,582 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 40 treesize of output 35 [2025-01-09 02:51:07,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:51:07,671 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:51:08,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:51:08,061 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:51:08,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:51:08,648 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:51:08,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:51:08,860 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:51:09,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)))) is different from false [2025-01-09 02:51:09,091 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)))) is different from true [2025-01-09 02:51:09,246 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-01-09 02:51:09,247 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 84 [2025-01-09 02:51:09,259 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 55 treesize of output 19 [2025-01-09 02:51:09,407 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2025-01-09 02:51:09,407 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 1 case distinctions, treesize of input 36 treesize of output 31 [2025-01-09 02:51:09,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)))) is different from false [2025-01-09 02:51:09,471 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)))) is different from true [2025-01-09 02:51:09,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:51:09,544 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 111 treesize of output 75 [2025-01-09 02:51:09,619 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:51:09,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:51:09,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_24| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))))) is different from false [2025-01-09 02:51:09,647 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_24| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))))) is different from true [2025-01-09 02:51:09,670 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 51 treesize of output 31 [2025-01-09 02:51:09,680 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:51:09,773 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2025-01-09 02:51:09,779 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2025-01-09 02:51:09,857 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2025-01-09 02:51:09,863 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2025-01-09 02:51:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2025-01-09 02:51:10,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:51:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935370075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:12,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:51:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2025-01-09 02:51:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258725386] [2025-01-09 02:51:12,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:51:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 02:51:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:12,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 02:51:12,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1431, Unknown=50, NotChecked=1456, Total=3080 [2025-01-09 02:51:12,048 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 41 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:13,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| 0)) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_14| |c_#memory_int#2|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= (select (select |v_#memory_int#2_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_14| .cse3 (select |c_#memory_int#2| .cse3))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2025-01-09 02:51:13,487 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| 0)) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_14| |c_#memory_int#2|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= (select (select |v_#memory_int#2_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_14| .cse3 (select |c_#memory_int#2| .cse3))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2025-01-09 02:51:13,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#2| .cse1) 0))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= .cse2 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse2 1)) (= (select |c_#valid| .cse1) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2025-01-09 02:51:13,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#2| .cse1) 0))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= .cse2 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse2 1)) (= (select |c_#valid| .cse1) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2025-01-09 02:51:13,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#2| .cse0) 0)) (.cse3 (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 1) .cse3) (not .cse3)))) is different from false [2025-01-09 02:51:13,516 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#2| .cse0) 0)) (.cse3 (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 1) .cse3) (not .cse3)))) is different from true [2025-01-09 02:51:13,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,533 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,542 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:51:13,548 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:51:13,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((|v_node_create_~temp~0#1.base_58| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_58|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_58|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_58|))))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (not (= |c_node_create_#res#1.base| 0)) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from false [2025-01-09 02:51:13,570 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((|v_node_create_~temp~0#1.base_58| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_58|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_58|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_58|))))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (not (= |c_node_create_#res#1.base| 0)) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from true [2025-01-09 02:51:13,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse4 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse7) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse7) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,592 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse4 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse7) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse7) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,615 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,640 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse6 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,663 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse6 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse6 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,685 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (not (= .cse1 0)) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse6 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse6 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,710 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1))) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse6 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (= (select .cse7 0) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:51:13,755 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1))) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_84 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_84 0)) (= (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (= (select .cse7 0) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:51:13,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse0 (select |c_#memory_int#2| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_24| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3))))))))) is different from false [2025-01-09 02:51:13,793 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse0 (select |c_#memory_int#2| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_24| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3))))))))) is different from true [2025-01-09 02:51:13,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2025-01-09 02:51:13,807 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2025-01-09 02:51:13,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select .cse0 0) 1))) is different from false [2025-01-09 02:51:13,888 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~ptr~0#1.base_24|)) (= (select |v_#valid_BEFORE_CALL_16| |v_node_create_~temp~0#1.base_58|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select .cse0 0) 1))) is different from true [2025-01-09 02:51:14,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_14| |c_#memory_int#2|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= (select (select |v_#memory_int#2_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_14| .cse3 (select |c_#memory_int#2| .cse3))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2025-01-09 02:51:14,096 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_14| |c_#memory_int#2|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= (select (select |v_#memory_int#2_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_14| .cse3 (select |c_#memory_int#2| .cse3))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2025-01-09 02:51:14,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#2| .cse1) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= .cse2 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse2 1)) (= (select |c_#valid| .cse1) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2025-01-09 02:51:14,110 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#2| .cse1) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= .cse2 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse2 1)) (= (select |c_#valid| .cse1) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2025-01-09 02:51:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:14,290 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-01-09 02:51:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 02:51:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 41 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2025-01-09 02:51:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:14,292 INFO L225 Difference]: With dead ends: 71 [2025-01-09 02:51:14,292 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 02:51:14,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=204, Invalid=1738, Unknown=86, NotChecked=3978, Total=6006 [2025-01-09 02:51:14,294 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1817 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:14,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 363 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 1817 Unchecked, 1.1s Time] [2025-01-09 02:51:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 02:51:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-01-09 02:51:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-01-09 02:51:14,307 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 40 [2025-01-09 02:51:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:14,308 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-01-09 02:51:14,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 41 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-01-09 02:51:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 02:51:14,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:14,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:14,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 02:51:14,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:14,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:14,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2043508152, now seen corresponding path program 1 times [2025-01-09 02:51:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516953440] [2025-01-09 02:51:14,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:14,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 02:51:14,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 02:51:14,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:14,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516953440] [2025-01-09 02:51:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516953440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315983653] [2025-01-09 02:51:16,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:16,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:16,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:16,822 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:51:16,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 02:51:16,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 02:51:16,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 02:51:16,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:16,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:16,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 02:51:16,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:51:17,268 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:51:17,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 02:51:18,142 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 18 treesize of output 4 [2025-01-09 02:51:18,156 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 9 treesize of output 3 [2025-01-09 02:51:18,554 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_67| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_67| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_67|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_67|) 0))) is different from true [2025-01-09 02:51:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:51:18,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 27 treesize of output 22 [2025-01-09 02:51:18,624 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:51:18,624 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 15 treesize of output 15 [2025-01-09 02:51:19,950 INFO L349 Elim1Store]: treesize reduction 103, result has 38.3 percent of original size [2025-01-09 02:51:19,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 89 [2025-01-09 02:51:20,017 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 26 treesize of output 18 [2025-01-09 02:51:20,028 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 22 treesize of output 14 [2025-01-09 02:51:20,268 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 20 treesize of output 8 [2025-01-09 02:51:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 02:51:20,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:51:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315983653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:51:22,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:51:22,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 43 [2025-01-09 02:51:22,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801955419] [2025-01-09 02:51:22,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:51:22,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 02:51:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:22,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 02:51:22,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2099, Unknown=2, NotChecked=92, Total=2352 [2025-01-09 02:51:22,024 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 43 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 36 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:51:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:27,261 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-01-09 02:51:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 02:51:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 36 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-01-09 02:51:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:27,267 INFO L225 Difference]: With dead ends: 77 [2025-01-09 02:51:27,267 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 02:51:27,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=341, Invalid=4217, Unknown=2, NotChecked=132, Total=4692 [2025-01-09 02:51:27,268 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:27,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 307 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 784 Invalid, 0 Unknown, 46 Unchecked, 2.4s Time] [2025-01-09 02:51:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 02:51:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-01-09 02:51:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-01-09 02:51:27,286 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 40 [2025-01-09 02:51:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-01-09 02:51:27,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 36 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:51:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-01-09 02:51:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 02:51:27,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:27,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:27,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 02:51:27,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:51:27,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:27,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1287268032, now seen corresponding path program 2 times [2025-01-09 02:51:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759595808] [2025-01-09 02:51:27,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:51:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:27,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 02:51:27,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:51:27,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:51:27,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat