./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:53:13,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:53:13,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:53:13,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:53:13,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:53:13,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:53:13,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:53:13,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:53:13,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:53:13,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:53:13,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:53:13,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:53:13,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:53:13,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:53:13,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:53:13,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:53:13,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:53:13,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:53:13,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:53:13,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:53:13,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:53:13,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:53:13,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:53:13,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:53:13,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:53:13,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:53:13,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:53:13,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:53:13,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:53:13,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:53:13,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:53:13,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:53:13,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:53:13,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:53:13,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:53:13,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:53:13,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:53:13,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:53:13,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:53:13,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:53:13,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:53:13,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:53:13,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-11-22 00:53:14,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:53:14,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:53:14,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:53:14,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:53:14,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:53:14,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-22 00:53:15,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:53:15,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:53:15,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-22 00:53:15,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c387f98/964735e7ccd94c0abd90cb7183e6348d/FLAG3d1c6b8e0 [2024-11-22 00:53:16,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c387f98/964735e7ccd94c0abd90cb7183e6348d [2024-11-22 00:53:16,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:53:16,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:53:16,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:53:16,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:53:16,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:53:16,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5bfa15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16, skipping insertion in model container [2024-11-22 00:53:16,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:53:16,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-22 00:53:16,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:53:16,653 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:53:16,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-22 00:53:16,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:53:16,732 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:53:16,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16 WrapperNode [2024-11-22 00:53:16,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:53:16,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:53:16,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:53:16,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:53:16,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,810 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2024-11-22 00:53:16,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:53:16,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:53:16,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:53:16,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:53:16,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,850 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-11-22 00:53:16,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:53:16,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:53:16,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:53:16,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:53:16,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (1/1) ... [2024-11-22 00:53:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:53:16,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:53:16,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 00:53:16,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 00:53:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:53:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:53:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 00:53:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:53:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:53:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 00:53:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-22 00:53:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-22 00:53:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:53:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:53:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 00:53:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:53:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 00:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 00:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 00:53:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:53:16,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:53:17,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:53:17,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:53:17,329 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-22 00:53:17,329 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:53:17,340 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:53:17,341 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 00:53:17,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:53:17 BoogieIcfgContainer [2024-11-22 00:53:17,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:53:17,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:53:17,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:53:17,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:53:17,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:53:16" (1/3) ... [2024-11-22 00:53:17,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf78983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:53:17, skipping insertion in model container [2024-11-22 00:53:17,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:53:16" (2/3) ... [2024-11-22 00:53:17,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf78983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:53:17, skipping insertion in model container [2024-11-22 00:53:17,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:53:17" (3/3) ... [2024-11-22 00:53:17,352 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-22 00:53:17,369 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:53:17,369 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:53:17,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:53:17,434 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;@3b091f43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:53:17,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:53:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2024-11-22 00:53:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:53:17,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:17,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:53:17,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:17,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2024-11-22 00:53:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227277376] [2024-11-22 00:53:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:53:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227277376] [2024-11-22 00:53:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227277376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:53:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:53:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:53:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992957626] [2024-11-22 00:53:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:53:17,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:53:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:53:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:53:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:53:17,757 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-11-22 00:53:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:53:17,775 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-11-22 00:53:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:53:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2024-11-22 00:53:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:53:17,810 INFO L225 Difference]: With dead ends: 57 [2024-11-22 00:53:17,810 INFO L226 Difference]: Without dead ends: 26 [2024-11-22 00:53:17,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:53:17,830 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:53:17,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:53:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-22 00:53:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-22 00:53:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2024-11-22 00:53:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-22 00:53:17,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-22 00:53:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:53:17,945 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-22 00:53:17,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-11-22 00:53:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-22 00:53:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:53:17,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:17,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:53:17,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:53:17,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:17,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2024-11-22 00:53:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:17,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459113713] [2024-11-22 00:53:17,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:53:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459113713] [2024-11-22 00:53:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459113713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:53:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:53:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:53:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770076454] [2024-11-22 00:53:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:53:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:53:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:53:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:53:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:53:18,109 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-22 00:53:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:53:18,131 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-11-22 00:53:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:53:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-22 00:53:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:53:18,133 INFO L225 Difference]: With dead ends: 50 [2024-11-22 00:53:18,133 INFO L226 Difference]: Without dead ends: 31 [2024-11-22 00:53:18,134 INFO L431 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 [2024-11-22 00:53:18,135 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 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 [2024-11-22 00:53:18,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:53:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-22 00:53:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-22 00:53:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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) [2024-11-22 00:53:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-22 00:53:18,144 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2024-11-22 00:53:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:53:18,145 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-22 00:53:18,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-22 00:53:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-22 00:53:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:53:18,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:18,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:53:18,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:53:18,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2024-11-22 00:53:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688216929] [2024-11-22 00:53:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:53:18,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:18,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688216929] [2024-11-22 00:53:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688216929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:53:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:53:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:53:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294723697] [2024-11-22 00:53:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:53:18,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:53:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:53:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:53:18,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:53:18,285 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-22 00:53:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:53:18,312 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-22 00:53:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:53:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-22 00:53:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:53:18,316 INFO L225 Difference]: With dead ends: 54 [2024-11-22 00:53:18,316 INFO L226 Difference]: Without dead ends: 30 [2024-11-22 00:53:18,317 INFO L431 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 [2024-11-22 00:53:18,318 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:53:18,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:53:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-22 00:53:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-22 00:53:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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) [2024-11-22 00:53:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-22 00:53:18,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2024-11-22 00:53:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:53:18,322 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-22 00:53:18,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-22 00:53:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-22 00:53:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:53:18,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:18,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:53:18,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:53:18,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2024-11-22 00:53:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791389522] [2024-11-22 00:53:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:53:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791389522] [2024-11-22 00:53:18,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791389522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:53:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695235880] [2024-11-22 00:53:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:53:18,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:53:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 00:53:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:18,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:53:18,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:53:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:53:18,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:53:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:53:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695235880] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:53:18,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:53:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 00:53:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493586757] [2024-11-22 00:53:18,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:53:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:53:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:53:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:53:18,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:53:18,763 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-22 00:53:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:53:18,793 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-22 00:53:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:53:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 27 [2024-11-22 00:53:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:53:18,795 INFO L225 Difference]: With dead ends: 51 [2024-11-22 00:53:18,795 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 00:53:18,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:53:18,797 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 82 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 [2024-11-22 00:53:18,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 82 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:53:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 00:53:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 00:53:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2024-11-22 00:53:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-22 00:53:18,804 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2024-11-22 00:53:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:53:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-22 00:53:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-22 00:53:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-22 00:53:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:53:18,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:18,809 INFO L215 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] [2024-11-22 00:53:18,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 00:53:19,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:19,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2024-11-22 00:53:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840103390] [2024-11-22 00:53:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 00:53:19,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840103390] [2024-11-22 00:53:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840103390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:53:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220010679] [2024-11-22 00:53:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:19,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:19,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:53:19,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:53:19,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 00:53:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:19,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 00:53:19,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:53:19,805 INFO L349 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2024-11-22 00:53:19,806 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 3 case distinctions, treesize of input 32 treesize of output 47 [2024-11-22 00:53:19,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:19,901 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 24 treesize of output 20 [2024-11-22 00:53:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:53:19,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:53:19,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220010679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:53:19,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:53:19,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 18 [2024-11-22 00:53:19,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641774177] [2024-11-22 00:53:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:53:19,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 00:53:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:53:19,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 00:53:19,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-22 00:53:19,925 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 00:53:23,952 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] [2024-11-22 00:53:27,969 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] [2024-11-22 00:53:31,993 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] [2024-11-22 00:53:36,050 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] [2024-11-22 00:53:40,079 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] [2024-11-22 00:53:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:53:40,187 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-11-22 00:53:40,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 00:53:40,187 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-22 00:53:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:53:40,188 INFO L225 Difference]: With dead ends: 65 [2024-11-22 00:53:40,188 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 00:53:40,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-22 00:53:40,189 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:53:40,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-22 00:53:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 00:53:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-22 00:53:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2024-11-22 00:53:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-22 00:53:40,194 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 37 [2024-11-22 00:53:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:53:40,194 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-22 00:53:40,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 00:53:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-22 00:53:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:53:40,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:40,196 INFO L215 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] [2024-11-22 00:53:40,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 00:53:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:40,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2024-11-22 00:53:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876730208] [2024-11-22 00:53:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 00:53:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876730208] [2024-11-22 00:53:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876730208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:53:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148046205] [2024-11-22 00:53:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:40,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:53:40,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:53:40,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 00:53:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:40,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 00:53:40,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:53:40,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-22 00:53:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:53:40,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:53:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 00:53:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148046205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:53:40,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:53:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2024-11-22 00:53:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910788089] [2024-11-22 00:53:40,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:53:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 00:53:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:53:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 00:53:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-22 00:53:40,872 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 00:53:44,889 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] [2024-11-22 00:53:48,900 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] [2024-11-22 00:53:52,924 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] [2024-11-22 00:53:56,944 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] [2024-11-22 00:53:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:53:57,022 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-22 00:53:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 00:53:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-22 00:53:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:53:57,024 INFO L225 Difference]: With dead ends: 45 [2024-11-22 00:53:57,024 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 00:53:57,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 00:53:57,025 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:53:57,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 221 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-22 00:53:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 00:53:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 00:53:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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) [2024-11-22 00:53:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-22 00:53:57,032 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2024-11-22 00:53:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:53:57,032 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-22 00:53:57,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 00:53:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-22 00:53:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:53:57,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:53:57,034 INFO L215 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] [2024-11-22 00:53:57,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 00:53:57,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:57,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:53:57,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:53:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2024-11-22 00:53:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:53:57,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081385959] [2024-11-22 00:53:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:53:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:53:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:53:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081385959] [2024-11-22 00:53:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081385959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:53:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759132640] [2024-11-22 00:53:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:53:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:53:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:53:58,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:53:58,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 00:53:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:53:58,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-22 00:53:58,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:53:58,886 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 [2024-11-22 00:53:59,122 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:53:59,122 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 [2024-11-22 00:53:59,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-22 00:53:59,261 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 [2024-11-22 00:53:59,549 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 [2024-11-22 00:53:59,553 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 [2024-11-22 00:53:59,721 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-22 00:53:59,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-22 00:53:59,730 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 [2024-11-22 00:53:59,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-22 00:53:59,980 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 [2024-11-22 00:54:00,040 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 [2024-11-22 00:54:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:00,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:54:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759132640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:00,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:54:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2024-11-22 00:54:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338367281] [2024-11-22 00:54:00,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:54:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 00:54:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:54:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 00:54:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2363, Unknown=21, NotChecked=0, Total=2550 [2024-11-22 00:54:00,414 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 38 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) [2024-11-22 00:54:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:54:01,211 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-22 00:54:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 00:54:01,211 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 38 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 [2024-11-22 00:54:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:54:01,212 INFO L225 Difference]: With dead ends: 54 [2024-11-22 00:54:01,212 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 00:54:01,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=294, Invalid=3845, Unknown=21, NotChecked=0, Total=4160 [2024-11-22 00:54:01,214 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 00:54:01,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 250 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 00:54:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 00:54:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-11-22 00:54:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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) [2024-11-22 00:54:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-22 00:54:01,221 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2024-11-22 00:54:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:54:01,222 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-22 00:54:01,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 38 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) [2024-11-22 00:54:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-22 00:54:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:54:01,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:54:01,224 INFO L215 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, 1, 1] [2024-11-22 00:54:01,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 00:54:01,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:01,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:54:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:54:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1868742190, now seen corresponding path program 1 times [2024-11-22 00:54:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:54:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489943439] [2024-11-22 00:54:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:54:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:54:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:54:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489943439] [2024-11-22 00:54:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489943439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489740757] [2024-11-22 00:54:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:54:02,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:54:02,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 00:54:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:02,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-22 00:54:02,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:54:02,448 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 [2024-11-22 00:54:02,634 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:54:02,635 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 [2024-11-22 00:54:02,673 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 13 treesize of output 9 [2024-11-22 00:54:02,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 00:54:02,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-22 00:54:02,915 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 18 [2024-11-22 00:54:02,923 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 [2024-11-22 00:54:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:02,976 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 51 [2024-11-22 00:54:02,993 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 00:54:02,993 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 34 treesize of output 36 [2024-11-22 00:54:03,211 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-22 00:54:03,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 54 [2024-11-22 00:54:03,230 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-22 00:54:03,230 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 3 case distinctions, treesize of input 99 treesize of output 93 [2024-11-22 00:54:03,237 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 35 treesize of output 27 [2024-11-22 00:54:03,269 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 48 treesize of output 32 [2024-11-22 00:54:03,270 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 36 treesize of output 24 [2024-11-22 00:54:03,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-22 00:54:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:03,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:54:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489740757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:03,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:54:03,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 43 [2024-11-22 00:54:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096845204] [2024-11-22 00:54:03,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:54:03,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-22 00:54:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:54:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-22 00:54:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2311, Unknown=1, NotChecked=0, Total=2450 [2024-11-22 00:54:03,766 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 43 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 00:54:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:54:05,038 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-22 00:54:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 00:54:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 5 states have call successors, (5), 3 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 42 [2024-11-22 00:54:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:54:05,039 INFO L225 Difference]: With dead ends: 59 [2024-11-22 00:54:05,039 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 00:54:05,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=340, Invalid=4771, Unknown=1, NotChecked=0, Total=5112 [2024-11-22 00:54:05,042 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 00:54:05,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 465 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 00:54:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 00:54:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-11-22 00:54:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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) [2024-11-22 00:54:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-22 00:54:05,054 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 42 [2024-11-22 00:54:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:54:05,055 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-22 00:54:05,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 00:54:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-22 00:54:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:54:05,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:54:05,056 INFO L215 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, 1, 1] [2024-11-22 00:54:05,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 00:54:05,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:05,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:54:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:54:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2024-11-22 00:54:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:54:05,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410185242] [2024-11-22 00:54:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:54:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:06,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:54:06,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410185242] [2024-11-22 00:54:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410185242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:06,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242666948] [2024-11-22 00:54:06,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:06,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:06,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:54:06,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:54:06,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 00:54:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:07,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-22 00:54:07,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:54:07,200 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 [2024-11-22 00:54:07,451 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:54:07,451 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 [2024-11-22 00:54:07,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-22 00:54:07,511 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 [2024-11-22 00:54:07,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 00:54:07,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-22 00:54:07,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 00:54:07,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-22 00:54:07,831 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 [2024-11-22 00:54:07,837 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 [2024-11-22 00:54:08,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:08,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-22 00:54:08,037 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 00:54:08,037 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 [2024-11-22 00:54:08,045 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 [2024-11-22 00:54:08,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-22 00:54:08,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-22 00:54:08,562 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 [2024-11-22 00:54:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:08,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:54:16,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) v_ArrVal_1127) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1126) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-22 00:54:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242666948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:16,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:54:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2024-11-22 00:54:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67187877] [2024-11-22 00:54:16,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:54:16,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 00:54:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:54:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 00:54:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2869, Unknown=45, NotChecked=108, Total=3192 [2024-11-22 00:54:16,528 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 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) [2024-11-22 00:54:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:54:19,758 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-22 00:54:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 00:54:19,758 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 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 42 [2024-11-22 00:54:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:54:19,760 INFO L225 Difference]: With dead ends: 59 [2024-11-22 00:54:19,760 INFO L226 Difference]: Without dead ends: 57 [2024-11-22 00:54:19,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=369, Invalid=5596, Unknown=45, NotChecked=152, Total=6162 [2024-11-22 00:54:19,762 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 00:54:19,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 365 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 00:54:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-22 00:54:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2024-11-22 00:54:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 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) [2024-11-22 00:54:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-22 00:54:19,774 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 42 [2024-11-22 00:54:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:54:19,774 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-22 00:54:19,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 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) [2024-11-22 00:54:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-22 00:54:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 00:54:19,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:54:19,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:54:19,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 00:54:19,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:19,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:54:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:54:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2024-11-22 00:54:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:54:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502289204] [2024-11-22 00:54:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:54:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:54:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502289204] [2024-11-22 00:54:23,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502289204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425972321] [2024-11-22 00:54:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:54:23,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:54:23,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 00:54:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:23,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-11-22 00:54:23,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:54:23,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 00:54:23,778 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 [2024-11-22 00:54:23,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2024-11-22 00:54:24,374 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-22 00:54:24,378 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-22 00:54:24,422 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 [2024-11-22 00:54:24,479 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:54:24,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 00:54:24,494 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 [2024-11-22 00:54:24,509 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |v_#memory_int#1_188| .cse0))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2024-11-22 00:54:24,513 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |v_#memory_int#1_188| .cse0))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2024-11-22 00:54:24,587 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 00:54:24,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 110 [2024-11-22 00:54:24,616 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-22 00:54:24,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-22 00:54:24,662 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 47 treesize of output 23 [2024-11-22 00:54:24,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse0)))) is different from false [2024-11-22 00:54:24,681 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse0)))) is different from true [2024-11-22 00:54:24,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-22 00:54:24,738 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-22 00:54:24,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) .cse1)))) is different from false [2024-11-22 00:54:24,840 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) .cse1)))) is different from true [2024-11-22 00:54:24,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-22 00:54:24,909 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-22 00:54:24,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 72 treesize of output 40 [2024-11-22 00:54:24,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-22 00:54:24,951 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 [2024-11-22 00:54:24,982 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-22 00:54:24,985 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-22 00:54:25,018 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-22 00:54:25,021 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-22 00:54:25,088 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-22 00:54:25,094 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-22 00:54:25,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:25,199 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 80 treesize of output 57 [2024-11-22 00:54:25,251 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-22 00:54:25,251 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 40 treesize of output 47 [2024-11-22 00:54:25,339 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 00:54:25,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-11-22 00:54:25,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-22 00:54:25,413 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-22 00:54:25,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-22 00:54:25,535 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-22 00:54:25,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))))) is different from false [2024-11-22 00:54:25,636 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))))) is different from true [2024-11-22 00:54:25,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse6 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse6))))) is different from false [2024-11-22 00:54:25,857 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse6 (= .cse4 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse6))))) is different from true [2024-11-22 00:54:26,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:26,133 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-22 00:54:26,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 133 [2024-11-22 00:54:26,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:26,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:26,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 43 [2024-11-22 00:54:26,174 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 103 treesize of output 54 [2024-11-22 00:54:26,209 INFO L349 Elim1Store]: treesize reduction 37, result has 36.2 percent of original size [2024-11-22 00:54:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-22 00:54:26,305 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-11-22 00:54:26,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 90 [2024-11-22 00:54:26,312 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:54:26,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (or (= (select (select |c_#memory_int#1| .cse4) 0) 1) (= .cse4 .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2024-11-22 00:54:26,359 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (or (= (select (select |c_#memory_int#1| .cse4) 0) 1) (= .cse4 .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2024-11-22 00:54:26,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:54:26,401 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 99 treesize of output 67 [2024-11-22 00:54:26,443 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 00:54:26,443 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 [2024-11-22 00:54:26,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))))) is different from false [2024-11-22 00:54:26,464 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))))) is different from true [2024-11-22 00:54:26,517 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 36 treesize of output 20 [2024-11-22 00:54:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 00:54:26,565 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-22 00:54:26,568 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-22 00:54:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-22 00:54:26,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:54:26,837 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (or (= (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1339) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1341) .cse0) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1343) .cse0) .cse1))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1340 (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2 (select v_ArrVal_1340 .cse2))))))) is different from false [2024-11-22 00:54:26,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1340) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1339) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1341) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1344) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1343) .cse1) .cse2)))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4))) (store (select |c_#memory_int#1| .cse0) .cse4 (select v_ArrVal_1340 .cse4))) v_ArrVal_1340)))))) is different from false [2024-11-22 00:54:26,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (not (= v_ArrVal_1340 (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4))) (store (select |c_#memory_int#1| .cse2) .cse3 (select v_ArrVal_1340 .cse3))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_1340) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1339) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1341) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1344) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1343) .cse4) .cse5)))))))) is different from false [2024-11-22 00:54:26,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_1340) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1339) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1341) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1344) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1343) .cse3) .cse4)))) (not (= v_ArrVal_1340 (let ((.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4))) (store (select |c_#memory_int#1| .cse2) .cse5 (select v_ArrVal_1340 .cse5))))))))) is different from false [2024-11-22 00:54:27,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| Int) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1354) .cse0) .cse1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1353) .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_1340) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1339) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1341) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1344) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1343) .cse3) .cse4)))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1355) .cse2) .cse5 (select v_ArrVal_1340 .cse5))) v_ArrVal_1340)))))) is different from false [2024-11-22 00:54:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425972321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:27,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:54:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 50 [2024-11-22 00:54:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078852826] [2024-11-22 00:54:27,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:54:27,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 00:54:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:54:27,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 00:54:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1170, Unknown=37, NotChecked=1848, Total=3192 [2024-11-22 00:54:27,055 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 50 states, 48 states have (on average 1.375) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:54:27,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from false [2024-11-22 00:54:27,776 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from true [2024-11-22 00:54:27,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (and (or .cse0 (= .cse1 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |v_#memory_int#1_188| .cse3))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2024-11-22 00:54:27,788 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (and (or .cse0 (= .cse1 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |v_#memory_int#1_188| .cse3))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from true [2024-11-22 00:54:27,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse3) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (or (= .cse4 1) .cse0) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from false [2024-11-22 00:54:27,796 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse3) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (or (= .cse4 1) .cse0) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from true [2024-11-22 00:54:27,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-22 00:54:27,805 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-22 00:54:27,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse2 (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse3) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse2) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse2) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from false [2024-11-22 00:54:27,815 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse2 (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse3) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse2) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse2) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from true [2024-11-22 00:54:27,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= .cse3 .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse4) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |c_#valid| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from false [2024-11-22 00:54:27,825 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= .cse3 .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse4) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |c_#valid| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from true [2024-11-22 00:54:27,831 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-22 00:54:27,834 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-22 00:54:27,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse7 (store |c_old(#memory_int#1)| .cse4 (select |c_#memory_int#1| .cse4)))) (let ((.cse8 (@diff .cse7 |c_#memory_int#1|))) (let ((.cse5 (store .cse7 .cse8 (select |c_#memory_int#1| .cse8)))) (let ((.cse6 (@diff .cse5 |c_#memory_int#1|)) (.cse9 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse3)) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse4) 0)) (or (= |c_#memory_int#1| .cse5) (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_int#1| (store .cse5 .cse6 (select |c_#memory_int#1| .cse6))) (or (= |c_#memory_int#1| .cse7) (= (select |c_old(#valid)| .cse8) 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse9 (select |c_#memory_$Pointer$#1.offset| .cse9))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse3 0)))))))) is different from false [2024-11-22 00:54:27,847 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse7 (store |c_old(#memory_int#1)| .cse4 (select |c_#memory_int#1| .cse4)))) (let ((.cse8 (@diff .cse7 |c_#memory_int#1|))) (let ((.cse5 (store .cse7 .cse8 (select |c_#memory_int#1| .cse8)))) (let ((.cse6 (@diff .cse5 |c_#memory_int#1|)) (.cse9 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse3)) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse4) 0)) (or (= |c_#memory_int#1| .cse5) (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_int#1| (store .cse5 .cse6 (select |c_#memory_int#1| .cse6))) (or (= |c_#memory_int#1| .cse7) (= (select |c_old(#valid)| .cse8) 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse9 (select |c_#memory_$Pointer$#1.offset| .cse9))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse3 0)))))))) is different from true [2024-11-22 00:54:27,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (= .cse7 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7) (= (select (select |c_#memory_int#1| .cse7) 0) 1) .cse8) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5) .cse8) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)))))) is different from false [2024-11-22 00:54:27,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (= .cse7 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7) (= (select (select |c_#memory_int#1| .cse7) 0) 1) .cse8) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5) .cse8) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)))))) is different from true [2024-11-22 00:54:27,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (= .cse6 .cse4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse3 .cse7)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse6) 0) 1) .cse8) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse7) 0)))))) is different from false [2024-11-22 00:54:27,882 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (= .cse6 .cse4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse3 .cse7)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse6) 0) 1) .cse8) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse7) 0)))))) is different from true [2024-11-22 00:54:27,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (= .cse5 .cse3))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)))))) is different from false [2024-11-22 00:54:27,898 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (= .cse5 .cse3))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)))))) is different from true [2024-11-22 00:54:27,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (= .cse5 .cse3))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0)))))) is different from false [2024-11-22 00:54:27,913 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (= .cse5 .cse3))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0)))))) is different from true [2024-11-22 00:54:27,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4)) (.cse8 (= .cse5 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (<= .cse7 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse7 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (not (= .cse9 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9))))))) is different from false [2024-11-22 00:54:27,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4)) (.cse8 (= .cse5 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (<= .cse7 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse7 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (not (= .cse9 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse8) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9))))))) is different from true [2024-11-22 00:54:27,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse5) 0) 1) (= .cse5 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)))))))) is different from false [2024-11-22 00:54:27,943 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse5) 0) 1) (= .cse5 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)))))))) is different from true [2024-11-22 00:54:27,964 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_int#1| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select .cse1 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (= .cse2 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0)))))) is different from false [2024-11-22 00:54:27,967 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_int#1| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select .cse1 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (= .cse2 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0)))))) is different from true [2024-11-22 00:54:28,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |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|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2024-11-22 00:54:28,038 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |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|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2024-11-22 00:54:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:54:28,290 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-22 00:54:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 00:54:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.375) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 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 44 [2024-11-22 00:54:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:54:28,291 INFO L225 Difference]: With dead ends: 75 [2024-11-22 00:54:28,291 INFO L226 Difference]: Without dead ends: 73 [2024-11-22 00:54:28,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=191, Invalid=1448, Unknown=69, NotChecked=4144, Total=5852 [2024-11-22 00:54:28,293 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1812 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 00:54:28,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 436 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 467 Invalid, 0 Unknown, 1812 Unchecked, 0.7s Time] [2024-11-22 00:54:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-22 00:54:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-22 00:54:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 00:54:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-22 00:54:28,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 44 [2024-11-22 00:54:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:54:28,305 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-22 00:54:28,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.375) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:54:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-22 00:54:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 00:54:28,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:54:28,306 INFO L215 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, 1, 1, 1] [2024-11-22 00:54:28,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 00:54:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:28,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:54:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:54:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2024-11-22 00:54:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:54:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538168512] [2024-11-22 00:54:28,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:54:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:54:28,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:54:28,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:54:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:54:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538168512] [2024-11-22 00:54:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538168512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370262475] [2024-11-22 00:54:31,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:54:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:54:31,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:54:31,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 00:54:32,074 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:54:32,074 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:54:32,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-22 00:54:32,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:54:32,162 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 [2024-11-22 00:54:32,364 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 [2024-11-22 00:54:32,373 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 [2024-11-22 00:54:33,088 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:54:33,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 00:54:33,150 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:54:33,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 00:54:33,216 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:54:33,216 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 [2024-11-22 00:54:33,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 00:54:33,353 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 [2024-11-22 00:54:33,377 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 17 treesize of output 19 [2024-11-22 00:54:33,386 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 8 treesize of output 7 [2024-11-22 00:54:33,544 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 00:54:33,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 63 [2024-11-22 00:54:33,557 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 46 treesize of output 25 [2024-11-22 00:54:34,237 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 00:54:34,237 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-22 00:54:34,250 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 [2024-11-22 00:54:34,258 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 [2024-11-22 00:54:34,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:34,705 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-22 00:54:34,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-22 00:54:34,756 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-22 00:54:34,756 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 [2024-11-22 00:54:34,815 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 00:54:34,815 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 [2024-11-22 00:54:35,603 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-22 00:54:35,603 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 31 [2024-11-22 00:54:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:35,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:54:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370262475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:36,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:54:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 52 [2024-11-22 00:54:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638895443] [2024-11-22 00:54:36,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:54:36,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 00:54:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:54:36,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 00:54:36,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3036, Unknown=0, NotChecked=0, Total=3192 [2024-11-22 00:54:36,679 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 52 states, 50 states have (on average 1.44) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:54:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:54:42,206 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2024-11-22 00:54:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-22 00:54:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.44) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 5 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 44 [2024-11-22 00:54:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:54:42,207 INFO L225 Difference]: With dead ends: 99 [2024-11-22 00:54:42,207 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 00:54:42,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=394, Invalid=7438, Unknown=0, NotChecked=0, Total=7832 [2024-11-22 00:54:42,210 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 00:54:42,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 326 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 00:54:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 00:54:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2024-11-22 00:54:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 00:54:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-11-22 00:54:42,224 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 44 [2024-11-22 00:54:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:54:42,224 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-11-22 00:54:42,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.44) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:54:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-22 00:54:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 00:54:42,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:54:42,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:54:42,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 00:54:42,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 00:54:42,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:54:42,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:54:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 1 times [2024-11-22 00:54:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:54:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924148352] [2024-11-22 00:54:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:54:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:54:44,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:54:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924148352] [2024-11-22 00:54:44,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924148352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39574820] [2024-11-22 00:54:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:54:44,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:44,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:54:44,738 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:54:44,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 00:54:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:54:45,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-22 00:54:45,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:54:45,195 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 [2024-11-22 00:54:45,532 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from false [2024-11-22 00:54:45,537 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from true [2024-11-22 00:54:45,549 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 [2024-11-22 00:54:45,586 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 [2024-11-22 00:54:45,594 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from false [2024-11-22 00:54:45,599 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from true [2024-11-22 00:54:45,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 00:54:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-22 00:54:45,668 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-22 00:54:45,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-22 00:54:45,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-22 00:54:45,704 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-22 00:54:45,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2024-11-22 00:54:45,741 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-11-22 00:54:45,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from false [2024-11-22 00:54:45,803 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from true [2024-11-22 00:54:45,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse1)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-22 00:54:45,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse1)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-22 00:54:45,876 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 27 treesize of output 19 [2024-11-22 00:54:45,883 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 33 treesize of output 17 [2024-11-22 00:54:45,915 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-22 00:54:45,918 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-22 00:54:45,967 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-22 00:54:45,970 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-22 00:54:46,034 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-22 00:54:46,037 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-22 00:54:46,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:46,103 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 36 treesize of output 31 [2024-11-22 00:54:46,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:46,111 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 49 treesize of output 38 [2024-11-22 00:54:46,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-22 00:54:46,161 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-22 00:54:46,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-22 00:54:46,238 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-22 00:54:46,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1))))))) is different from false [2024-11-22 00:54:46,318 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1))))))) is different from true [2024-11-22 00:54:46,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_27| .cse3))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (= .cse1 0) (= .cse0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1))))))) is different from false [2024-11-22 00:54:46,485 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_27| .cse3))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (= .cse1 0) (= .cse0 .cse2)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1))))))) is different from true [2024-11-22 00:54:46,686 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-11-22 00:54:46,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 68 [2024-11-22 00:54:46,692 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:54:46,722 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-11-22 00:54:46,722 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 81 [2024-11-22 00:54:46,768 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-22 00:54:46,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 174 [2024-11-22 00:54:46,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:54:46,803 INFO L349 Elim1Store]: treesize reduction 89, result has 9.2 percent of original size [2024-11-22 00:54:46,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 142 [2024-11-22 00:54:46,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ .cse4 4)))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1))) (not (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse4 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse3 0)))))) is different from false [2024-11-22 00:54:46,857 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ .cse4 4)))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 1))) (not (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse4 0) (= .cse2 .cse0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse3 0)))))) is different from true [2024-11-22 00:54:46,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:54:46,885 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 171 treesize of output 115 [2024-11-22 00:54:46,919 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 00:54:46,919 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 [2024-11-22 00:54:46,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ .cse3 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (or (= .cse3 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (not (= 0 .cse0)) (not (= .cse2 .cse0))))) is different from false [2024-11-22 00:54:46,941 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ .cse3 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (or (= .cse3 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (not (= 0 .cse0)) (not (= .cse2 .cse0))))) is different from true [2024-11-22 00:54:46,983 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 82 treesize of output 62 [2024-11-22 00:54:47,059 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from false [2024-11-22 00:54:47,062 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from true [2024-11-22 00:54:47,104 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 00:54:47,104 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2024-11-22 00:54:47,125 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_17 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_17) 1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from false [2024-11-22 00:54:47,128 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_17 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_17) 1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from true [2024-11-22 00:54:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-22 00:54:47,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:54:47,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (Array Int Int))) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1754))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1752) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1751) .cse1) .cse2) 4)))) 0))) is different from false [2024-11-22 00:54:47,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (Array Int Int))) (not (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1754))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1752) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1751) .cse1) .cse2) 4)))) 0))) is different from false [2024-11-22 00:54:47,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (Array Int Int))) (not (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1754))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1752) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1751) .cse1) .cse2) 4)))) 0))) is different from false [2024-11-22 00:54:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39574820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:54:47,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:54:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 49 [2024-11-22 00:54:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533536457] [2024-11-22 00:54:47,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:54:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-22 00:54:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:54:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-22 00:54:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1241, Unknown=39, NotChecked=1780, Total=3192 [2024-11-22 00:54:47,675 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:54:48,143 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2024-11-22 00:54:48,147 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2024-11-22 00:54:48,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-22 00:54:48,157 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-22 00:54:48,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (not .cse0) .cse1))) is different from false [2024-11-22 00:54:48,167 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (not .cse0) .cse1))) is different from true [2024-11-22 00:54:48,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (or .cse2 .cse3) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-22 00:54:48,177 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (or .cse2 .cse3) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-22 00:54:48,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse2) 1)))) is different from false [2024-11-22 00:54:48,186 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse2) 1)))) is different from true [2024-11-22 00:54:48,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse4)) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |c_#valid| .cse5)))))) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse4 .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-22 00:54:48,194 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse4)) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |c_#valid| .cse5)))))) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse4 .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-22 00:54:48,199 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-22 00:54:48,202 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-22 00:54:48,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-22 00:54:48,211 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_104) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-22 00:54:48,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse5 .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-22 00:54:48,228 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse5 .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-22 00:54:48,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse5 .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-22 00:54:48,241 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse5 .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-22 00:54:48,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse5 .cse1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))))))) is different from false [2024-11-22 00:54:48,253 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse5 .cse1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))))))) is different from true [2024-11-22 00:54:48,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse5 .cse1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0))))) is different from false [2024-11-22 00:54:48,270 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse5 .cse1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0))))) is different from true [2024-11-22 00:54:48,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_27| .cse5))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse3 0) (= .cse2 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))))) is different from false [2024-11-22 00:54:48,284 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_27| .cse5))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse3 0) (= .cse2 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))))) is different from true [2024-11-22 00:54:48,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ .cse6 4))) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 4) 0)) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse3 .cse1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1)))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0)))))) is different from false [2024-11-22 00:54:48,300 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ .cse6 4))) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2))) |v_old(#valid)_AFTER_CALL_27|) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 4) 0)) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse3 .cse1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_104 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_104) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1)))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0)))))) is different from true [2024-11-22 00:54:48,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse4 (= .cse5 0)) (.cse1 (select .cse0 (+ .cse5 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) .cse4 (or .cse4 (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (not (= 0 .cse1)) (not (= .cse3 .cse1)))))) is different from false [2024-11-22 00:54:48,308 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse4 (= .cse5 0)) (.cse1 (select .cse0 (+ .cse5 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) .cse4 (or .cse4 (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (not (= 0 .cse1)) (not (= .cse3 .cse1)))))) is different from true [2024-11-22 00:54:48,312 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2024-11-22 00:54:48,315 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_27| .cse1))) |v_old(#valid)_AFTER_CALL_27|) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2024-11-22 00:54:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:54:49,910 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-22 00:54:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-22 00:54:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 4 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 46 [2024-11-22 00:54:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:54:49,911 INFO L225 Difference]: With dead ends: 113 [2024-11-22 00:54:49,911 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 00:54:49,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=239, Invalid=2186, Unknown=71, NotChecked=4644, Total=7140 [2024-11-22 00:54:49,913 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2536 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 00:54:49,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 604 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 949 Invalid, 0 Unknown, 2536 Unchecked, 1.3s Time] [2024-11-22 00:54:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 00:54:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-11-22 00:54:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.125) internal successors, (90), 80 states have internal predecessors, (90), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 00:54:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-22 00:54:49,926 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 46 [2024-11-22 00:54:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:54:49,926 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-22 00:54:49,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:54:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-22 00:54:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 00:54:49,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:54:49,927 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:54:49,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 00:54:50,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:54:50,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:54:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:54:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2024-11-22 00:54:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:54:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910399737] [2024-11-22 00:54:50,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:54:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:54:50,183 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:54:50,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat