./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-27 19:50:22,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:22,746 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:50:22,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:22,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:22,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:22,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:22,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:22,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:22,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:22,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:22,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:22,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:22,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:22,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:22,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:22,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:22,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:22,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:50:22,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:22,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:22,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:22,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:22,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:22,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:22,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:22,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:22,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:22,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:22,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:22,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:22,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:22,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:22,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB 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-27 19:50:23,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:23,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:23,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:23,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:23,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:23,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-27 19:50:26,231 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/data/168e738e9/06714cc4545f4b35aa178f709a991cc0/FLAGc1900acc5 [2024-11-27 19:50:26,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:26,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-27 19:50:26,585 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/data/168e738e9/06714cc4545f4b35aa178f709a991cc0/FLAGc1900acc5 [2024-11-27 19:50:26,609 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/data/168e738e9/06714cc4545f4b35aa178f709a991cc0 [2024-11-27 19:50:26,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:26,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:26,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:26,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:26,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:26,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:26" (1/1) ... [2024-11-27 19:50:26,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d945d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:26, skipping insertion in model container [2024-11-27 19:50:26,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:26" (1/1) ... [2024-11-27 19:50:26,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:27,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-27 19:50:27,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:27,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:27,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-27 19:50:27,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:27,238 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:27,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27 WrapperNode [2024-11-27 19:50:27,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:27,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:27,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:27,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:27,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,288 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-11-27 19:50:27,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:27,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:27,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:27,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:27,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,331 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-27 19:50:27,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:27,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:27,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:27,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:27,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (1/1) ... [2024-11-27 19:50:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:27,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:27,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:50:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 19:50:27,433 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 19:50:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 19:50:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:27,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:27,578 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:27,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:27,834 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:27,834 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:27,846 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:27,847 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-27 19:50:27,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:27 BoogieIcfgContainer [2024-11-27 19:50:27,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:27,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:27,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:27,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:27,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:26" (1/3) ... [2024-11-27 19:50:27,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5a210b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:27, skipping insertion in model container [2024-11-27 19:50:27,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:27" (2/3) ... [2024-11-27 19:50:27,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5a210b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:27, skipping insertion in model container [2024-11-27 19:50:27,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:27" (3/3) ... [2024-11-27 19:50:27,862 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-27 19:50:27,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:27,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_equal.i that has 2 procedures, 35 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-27 19:50:27,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:27,974 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;@13ba7501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:27,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:50:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-27 19:50:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 19:50:27,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:27,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:27,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:27,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1478939061, now seen corresponding path program 1 times [2024-11-27 19:50:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432032287] [2024-11-27 19:50:28,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,257 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-27 19:50:28,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432032287] [2024-11-27 19:50:28,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432032287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204685910] [2024-11-27 19:50:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:50:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:50:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:50:28,289 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-27 19:50:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,310 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2024-11-27 19:50:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:50:28,313 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-27 19:50:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,319 INFO L225 Difference]: With dead ends: 63 [2024-11-27 19:50:28,320 INFO L226 Difference]: Without dead ends: 28 [2024-11-27 19:50:28,323 INFO L434 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-27 19:50:28,330 INFO L435 NwaCegarLoop]: 43 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, 43 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-27 19:50:28,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-27 19:50:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-27 19:50:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-27 19:50:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-27 19:50:28,373 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2024-11-27 19:50:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:28,374 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-27 19:50:28,374 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-27 19:50:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-27 19:50:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 19:50:28,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:28,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:50:28,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 568177888, now seen corresponding path program 1 times [2024-11-27 19:50:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326777682] [2024-11-27 19:50:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,675 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-27 19:50:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326777682] [2024-11-27 19:50:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326777682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409904000] [2024-11-27 19:50:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:28,680 INFO L87 Difference]: Start difference. First operand 28 states and 34 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-27 19:50:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,713 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-27 19:50:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:28,714 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-27 19:50:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,716 INFO L225 Difference]: With dead ends: 54 [2024-11-27 19:50:28,716 INFO L226 Difference]: Without dead ends: 33 [2024-11-27 19:50:28,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:28,718 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 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-27 19:50:28,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-27 19:50:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-27 19:50:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-27 19:50:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-27 19:50:28,730 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2024-11-27 19:50:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:28,733 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-27 19:50:28,734 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-27 19:50:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-27 19:50:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-27 19:50:28,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:28,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:28,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:50:28,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:28,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -598987087, now seen corresponding path program 1 times [2024-11-27 19:50:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710928441] [2024-11-27 19:50:28,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,957 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-27 19:50:28,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710928441] [2024-11-27 19:50:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710928441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111240788] [2024-11-27 19:50:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:28,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:28,963 INFO L87 Difference]: Start difference. First operand 29 states and 35 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-27 19:50:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,996 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-27 19:50:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:28,998 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-27 19:50:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,999 INFO L225 Difference]: With dead ends: 58 [2024-11-27 19:50:28,999 INFO L226 Difference]: Without dead ends: 32 [2024-11-27 19:50:29,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:29,001 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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-27 19:50:29,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-27 19:50:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-27 19:50:29,010 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-27 19:50:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-27 19:50:29,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2024-11-27 19:50:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:29,015 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-27 19:50:29,015 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-27 19:50:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-27 19:50:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-27 19:50:29,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:29,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:50:29,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2107632307, now seen corresponding path program 1 times [2024-11-27 19:50:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744637899] [2024-11-27 19:50:29,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:29,281 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-27 19:50:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744637899] [2024-11-27 19:50:29,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744637899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:29,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205899505] [2024-11-27 19:50:29,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:29,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:29,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:29,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:29,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:50:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 19:50:29,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:29,562 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-27 19:50:29,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:29,633 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-27 19:50:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205899505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:50:29,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:50:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-27 19:50:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851428491] [2024-11-27 19:50:29,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:50:29,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:29,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:29,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:29,638 INFO L87 Difference]: Start difference. First operand 32 states and 39 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-27 19:50:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:29,682 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-27 19:50:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:29,684 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-27 19:50:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:29,684 INFO L225 Difference]: With dead ends: 55 [2024-11-27 19:50:29,684 INFO L226 Difference]: Without dead ends: 34 [2024-11-27 19:50:29,685 INFO L434 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-27 19:50:29,686 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:29,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-27 19:50:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-27 19:50:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 19:50:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-27 19:50:29,697 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 27 [2024-11-27 19:50:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-27 19:50:29,697 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-27 19:50:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-27 19:50:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 19:50:29,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:29,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:29,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 19:50:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:29,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -15763260, now seen corresponding path program 1 times [2024-11-27 19:50:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009061915] [2024-11-27 19:50:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:31,120 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-27 19:50:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009061915] [2024-11-27 19:50:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009061915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990782434] [2024-11-27 19:50:31,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:31,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:31,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:50:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:31,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-27 19:50:31,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:31,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 19:50:31,612 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-27 19:50:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-27 19:50:31,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:31,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990782434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:31,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:50:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 21 [2024-11-27 19:50:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352832174] [2024-11-27 19:50:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:31,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:50:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:31,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:50:31,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-11-27 19:50:31,624 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 19:50:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:31,759 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-27 19:50:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:50:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-27 19:50:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:31,762 INFO L225 Difference]: With dead ends: 49 [2024-11-27 19:50:31,762 INFO L226 Difference]: Without dead ends: 46 [2024-11-27 19:50:31,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2024-11-27 19:50:31,763 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:31,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-27 19:50:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2024-11-27 19:50:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 19:50:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-27 19:50:31,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 37 [2024-11-27 19:50:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-27 19:50:31,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 19:50:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-27 19:50:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 19:50:31,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:31,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:31,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 19:50:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:31,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:31,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash -488731930, now seen corresponding path program 1 times [2024-11-27 19:50:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838498682] [2024-11-27 19:50:31,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-27 19:50:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838498682] [2024-11-27 19:50:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838498682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:32,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:50:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079304366] [2024-11-27 19:50:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:50:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:32,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:50:32,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:50:32,739 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 19:50:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:32,994 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-27 19:50:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:50:32,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-11-27 19:50:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:32,995 INFO L225 Difference]: With dead ends: 46 [2024-11-27 19:50:32,995 INFO L226 Difference]: Without dead ends: 44 [2024-11-27 19:50:32,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-27 19:50:32,996 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:32,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 198 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:50:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-27 19:50:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2024-11-27 19:50:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-27 19:50:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-27 19:50:33,001 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 38 [2024-11-27 19:50:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:33,002 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-27 19:50:33,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 19:50:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-27 19:50:33,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 19:50:33,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:33,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:50:33,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:33,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1394247207, now seen corresponding path program 1 times [2024-11-27 19:50:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964764337] [2024-11-27 19:50:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:33,254 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-27 19:50:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964764337] [2024-11-27 19:50:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964764337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460627085] [2024-11-27 19:50:33,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:33,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:33,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:33,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:33,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 19:50:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:33,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-27 19:50:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:33,643 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-27 19:50:33,647 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-27 19:50:33,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:33,716 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-27 19:50:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460627085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:50:33,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:50:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2024-11-27 19:50:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989814232] [2024-11-27 19:50:33,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:50:33,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:50:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:33,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:50:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:50:33,718 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 19:50:37,758 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-27 19:50:41,783 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-27 19:50:45,841 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-27 19:50:49,882 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-27 19:50:54,073 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-27 19:50:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:54,145 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2024-11-27 19:50:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:50:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-27 19:50:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:54,147 INFO L225 Difference]: With dead ends: 84 [2024-11-27 19:50:54,149 INFO L226 Difference]: Without dead ends: 54 [2024-11-27 19:50:54,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-27 19:50:54,150 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:54,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 266 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-27 19:50:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-27 19:50:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2024-11-27 19:50:54,167 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-27 19:50:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-27 19:50:54,168 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2024-11-27 19:50:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:54,169 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-27 19:50:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 19:50:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-27 19:50:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 19:50:54,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:54,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:54,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 19:50:54,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:54,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:54,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:54,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1519917385, now seen corresponding path program 1 times [2024-11-27 19:50:54,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:54,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256847296] [2024-11-27 19:50:54,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:50:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256847296] [2024-11-27 19:50:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256847296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615985496] [2024-11-27 19:50:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:54,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:54,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:54,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 19:50:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:54,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-27 19:50:54,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:55,050 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-27 19:50:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 19:50:55,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:50:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615985496] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:50:55,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:50:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2024-11-27 19:50:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462830246] [2024-11-27 19:50:55,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:50:55,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 19:50:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:55,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 19:50:55,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:50:55,143 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-27 19:50:59,184 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-27 19:51:03,208 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-27 19:51:07,249 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-27 19:51:11,271 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-27 19:51:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:11,394 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-27 19:51:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:51:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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 40 [2024-11-27 19:51:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:11,395 INFO L225 Difference]: With dead ends: 50 [2024-11-27 19:51:11,396 INFO L226 Difference]: Without dead ends: 40 [2024-11-27 19:51:11,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-27 19:51:11,397 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 239 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.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:11,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 239 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-27 19:51:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-27 19:51:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-27 19:51:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 19:51:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-27 19:51:11,404 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 40 [2024-11-27 19:51:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:11,404 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-27 19:51:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-27 19:51:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-27 19:51:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 19:51:11,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:11,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:11,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 19:51:11,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:11,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:11,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -272061327, now seen corresponding path program 1 times [2024-11-27 19:51:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107824490] [2024-11-27 19:51:11,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:13,590 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-27 19:51:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107824490] [2024-11-27 19:51:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107824490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811152504] [2024-11-27 19:51:13,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:13,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:13,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:13,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 19:51:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:14,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-27 19:51:14,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:14,345 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-27 19:51:14,760 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:51:14,760 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-27 19:51:14,886 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-27 19:51:14,992 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-27 19:51:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 19:51:15,510 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-27 19:51:15,812 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-27 19:51:15,813 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-27 19:51:15,842 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-27 19:51:16,260 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 59 treesize of output 26 [2024-11-27 19:51:16,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-27 19:51:16,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 19:51:16,517 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-27 19:51:16,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:16,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 (Array Int Int))) (or (not (= v_ArrVal_999 (let ((.cse0 (+ |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|) .cse0 (select v_ArrVal_999 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_998) (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-27 19:51:16,589 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 (Array Int 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|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_999) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_998) (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|))) (not (= v_ArrVal_999 (let ((.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))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_999 .cse1)))))))) is different from false [2024-11-27 19:51:16,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 (Array Int 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|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_999) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_998) (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|))) (not (= v_ArrVal_999 (let ((.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))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_999 .cse1)))))))) is different from false [2024-11-27 19:51:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811152504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:16,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2024-11-27 19:51:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365760972] [2024-11-27 19:51:16,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:16,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-27 19:51:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:16,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-27 19:51:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2105, Unknown=3, NotChecked=282, Total=2550 [2024-11-27 19:51:16,827 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 47 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 38 states have internal predecessors, (64), 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-27 19:51:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:18,657 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-27 19:51:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-27 19:51:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 38 states have internal predecessors, (64), 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 41 [2024-11-27 19:51:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:18,661 INFO L225 Difference]: With dead ends: 59 [2024-11-27 19:51:18,662 INFO L226 Difference]: Without dead ends: 57 [2024-11-27 19:51:18,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=286, Invalid=3505, Unknown=3, NotChecked=366, Total=4160 [2024-11-27 19:51:18,665 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:18,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 425 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 19:51:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-27 19:51:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-11-27 19:51:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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-27 19:51:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-27 19:51:18,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 41 [2024-11-27 19:51:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-27 19:51:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 38 states have internal predecessors, (64), 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-27 19:51:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-27 19:51:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 19:51:18,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:18,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:18,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 19:51:18,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:18,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 542101890, now seen corresponding path program 1 times [2024-11-27 19:51:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990696018] [2024-11-27 19:51:18,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:18,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 19:51:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990696018] [2024-11-27 19:51:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990696018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132049841] [2024-11-27 19:51:20,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:20,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:20,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:20,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:20,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 19:51:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:20,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-27 19:51:20,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:20,561 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-27 19:51:20,688 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:51:20,688 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-27 19:51:20,741 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-27 19:51:20,808 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:51:20,808 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-27 19:51:21,036 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-27 19:51:21,042 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-27 19:51:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:21,116 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-27 19:51:21,140 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-27 19:51:21,140 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-27 19:51:21,497 INFO L349 Elim1Store]: treesize reduction 53, result has 39.8 percent of original size [2024-11-27 19:51:21,497 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 71 [2024-11-27 19:51:21,505 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 67 treesize of output 50 [2024-11-27 19:51:21,559 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-27 19:51:21,565 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-27 19:51:21,623 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-27 19:51:21,668 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-27 19:51:21,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132049841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:22,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 38 [2024-11-27 19:51:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610696339] [2024-11-27 19:51:22,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:22,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-27 19:51:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:22,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-27 19:51:22,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1845, Unknown=6, NotChecked=0, Total=1980 [2024-11-27 19:51:22,306 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 32 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-27 19:51:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:24,027 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-27 19:51:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-27 19:51:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 32 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2024-11-27 19:51:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:24,028 INFO L225 Difference]: With dead ends: 66 [2024-11-27 19:51:24,028 INFO L226 Difference]: Without dead ends: 55 [2024-11-27 19:51:24,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=291, Invalid=3735, Unknown=6, NotChecked=0, Total=4032 [2024-11-27 19:51:24,030 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:24,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 390 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 19:51:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-27 19:51:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-27 19:51:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-27 19:51:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-27 19:51:24,039 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 43 [2024-11-27 19:51:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:24,039 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-27 19:51:24,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 32 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-27 19:51:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-27 19:51:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 19:51:24,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:24,040 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:24,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 19:51:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-27 19:51:24,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1873845954, now seen corresponding path program 1 times [2024-11-27 19:51:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82631505] [2024-11-27 19:51:24,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:26,600 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-27 19:51:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82631505] [2024-11-27 19:51:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82631505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868819402] [2024-11-27 19:51:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:26,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:26,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:26,604 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:26,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 19:51:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:27,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-27 19:51:27,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:27,383 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-27 19:51:27,708 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-27 19:51:27,788 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:51:27,788 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-27 19:51:27,905 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 26 treesize of output 11 [2024-11-27 19:51:27,916 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-27 19:51:28,018 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 19:51:28,018 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-27 19:51:28,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 19:51:28,427 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-27 19:51:28,434 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-27 19:51:28,439 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-27 19:51:28,804 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 19:51:28,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-27 19:51:28,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:28,824 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-27 19:51:28,842 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 19:51:28,842 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-27 19:51:29,340 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-27 19:51:29,532 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-27 19:51:29,631 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-27 19:51:29,748 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-27 19:51:29,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:29,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (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| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) v_ArrVal_1391) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1392) (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-27 19:51:30,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (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_1391) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1392) (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-27 19:51:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868819402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:30,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2024-11-27 19:51:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569045837] [2024-11-27 19:51:30,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:30,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-27 19:51:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:30,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-27 19:51:30,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2776, Unknown=31, NotChecked=214, Total=3192 [2024-11-27 19:51:30,272 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 43 states have internal predecessors, (74), 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-27 19:51:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:33,102 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-27 19:51:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-27 19:51:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.48) internal successors, (74), 43 states have internal predecessors, (74), 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 44 [2024-11-27 19:51:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:33,104 INFO L225 Difference]: With dead ends: 66 [2024-11-27 19:51:33,104 INFO L226 Difference]: Without dead ends: 64 [2024-11-27 19:51:33,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=368, Invalid=5460, Unknown=32, NotChecked=302, Total=6162 [2024-11-27 19:51:33,106 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:33,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 496 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-27 19:51:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-27 19:51:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2024-11-27 19:51:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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-27 19:51:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-27 19:51:33,117 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 44 [2024-11-27 19:51:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:33,117 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-27 19:51:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.48) internal successors, (74), 43 states have internal predecessors, (74), 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-27 19:51:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-27 19:51:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 19:51:33,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:33,121 INFO L218 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, 1] [2024-11-27 19:51:33,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:33,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:33,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash 9453265, now seen corresponding path program 2 times [2024-11-27 19:51:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:33,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316977095] [2024-11-27 19:51:33,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:51:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:33,395 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:51:33,396 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316977095] [2024-11-27 19:51:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316977095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052366450] [2024-11-27 19:51:36,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:51:36,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:36,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:36,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:36,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 19:51:37,232 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:51:37,232 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:37,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-27 19:51:37,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:37,301 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-27 19:51:37,433 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-27 19:51:37,438 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-27 19:51:37,815 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:51:37,815 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-27 19:51:37,833 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:51:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-27 19:51:37,859 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:51:37,859 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-27 19:51:37,948 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 11 treesize of output 14 [2024-11-27 19:51:37,955 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-27 19:51:37,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-27 19:51:37,975 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-27 19:51:38,096 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-27 19:51:38,097 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 94 treesize of output 57 [2024-11-27 19:51:38,111 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 42 [2024-11-27 19:51:38,688 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-27 19:51:38,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 45 [2024-11-27 19:51:38,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 36 treesize of output 14 [2024-11-27 19:51:38,701 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-27 19:51:38,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:38,901 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 19:51:38,901 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 142 treesize of output 103 [2024-11-27 19:51:38,938 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2024-11-27 19:51:38,938 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 72 treesize of output 80 [2024-11-27 19:51:38,948 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 11 [2024-11-27 19:51:38,968 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 11 treesize of output 3 [2024-11-27 19:51:39,002 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-27 19:51:39,002 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 34 treesize of output 36 [2024-11-27 19:51:39,278 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 139 treesize of output 107 [2024-11-27 19:51:39,641 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-27 19:51:39,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 36 [2024-11-27 19:51:39,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2024-11-27 19:51:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 19:51:39,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052366450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:40,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:40,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24] total 52 [2024-11-27 19:51:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935270167] [2024-11-27 19:51:40,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:40,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-27 19:51:40,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:40,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-27 19:51:40,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3041, Unknown=0, NotChecked=0, Total=3192 [2024-11-27 19:51:40,431 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 52 states, 50 states have (on average 1.56) internal successors, (78), 43 states have internal predecessors, (78), 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-27 19:51:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:44,737 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2024-11-27 19:51:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-27 19:51:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.56) internal successors, (78), 43 states have internal predecessors, (78), 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 47 [2024-11-27 19:51:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:44,739 INFO L225 Difference]: With dead ends: 103 [2024-11-27 19:51:44,739 INFO L226 Difference]: Without dead ends: 88 [2024-11-27 19:51:44,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=386, Invalid=7096, Unknown=0, NotChecked=0, Total=7482 [2024-11-27 19:51:44,742 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:44,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 410 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-27 19:51:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-27 19:51:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2024-11-27 19:51:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 19:51:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-27 19:51:44,758 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 47 [2024-11-27 19:51:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:44,758 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-27 19:51:44,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.56) internal successors, (78), 43 states have internal predecessors, (78), 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-27 19:51:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-27 19:51:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 19:51:44,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:44,760 INFO L218 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, 1] [2024-11-27 19:51:44,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 19:51:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-27 19:51:44,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:44,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2055793143, now seen corresponding path program 1 times [2024-11-27 19:51:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842422581] [2024-11-27 19:51:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:48,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842422581] [2024-11-27 19:51:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842422581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288345841] [2024-11-27 19:51:48,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:48,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:48,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:48,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:48,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 19:51:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:48,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 165 conjuncts are in the unsatisfiable core [2024-11-27 19:51:48,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:48,731 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-27 19:51:48,753 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-27 19:51:48,854 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-27 19:51:49,130 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_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-27 19:51:49,135 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_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-27 19:51:49,195 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:51:49,195 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-27 19:51:49,204 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-27 19:51:49,218 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-27 19:51:49,230 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |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) (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_243| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_243| |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 ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_243|))) (and (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_243| (store |v_#memory_int#1_BEFORE_CALL_6| .cse1 (select |v_#memory_int#1_243| .cse1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 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-27 19:51:49,235 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |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) (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_243| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_243| |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 ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_243|))) (and (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_243| (store |v_#memory_int#1_BEFORE_CALL_6| .cse1 (select |v_#memory_int#1_243| .cse1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 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-27 19:51:49,290 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 19:51:49,290 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-27 19:51:49,317 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-27 19:51:49,335 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-27 19:51:49,336 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-27 19:51:49,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (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| .cse1))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 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) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse0)))) is different from false [2024-11-27 19:51:49,354 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (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| .cse1))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 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) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse0)))) is different from true [2024-11-27 19:51:49,392 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 ((.cse2 (= .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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (or .cse2 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse2 (= (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) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-27 19:51:49,395 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 ((.cse2 (= .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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (or .cse2 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse2 (= (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) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-27 19:51:49,477 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))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= (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| .cse1) 0) 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 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) .cse2)))) is different from false [2024-11-27 19:51:49,480 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))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= (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| .cse1) 0) 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 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) .cse2)))) is different from true [2024-11-27 19:51:49,541 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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-27 19:51:49,544 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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-27 19:51:49,566 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-27 19:51:49,572 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-27 19:51:49,578 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-27 19:51:49,605 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-27 19:51:49,608 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-27 19:51:49,647 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= (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-27 19:51:49,649 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= (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-27 19:51:49,726 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (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|))) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1)))) (= |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-27 19:51:49,729 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (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|))) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 1)))) (= |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-27 19:51:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:49,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2024-11-27 19:51:49,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:49,817 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-27 19:51:49,853 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-27 19:51:49,853 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-27 19:51:49,912 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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-27 19:51:49,916 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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse4 (select |v_#valid_BEFORE_CALL_19| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-27 19:51:50,023 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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-27 19:51:50,026 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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-27 19:51:50,115 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))) (let ((.cse2 (= .cse1 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse2) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from false [2024-11-27 19:51:50,118 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))) (let ((.cse2 (= .cse1 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse2) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from true [2024-11-27 19:51:50,412 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse2 (= .cse0 .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (or (= .cse1 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from false [2024-11-27 19:51:50,416 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse2 (= .cse0 .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (or (= .cse1 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from true [2024-11-27 19:51:50,536 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse2 (= .cse0 .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (or (= .cse1 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from false [2024-11-27 19:51:50,540 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse2 (= .cse0 .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (or (= .cse1 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from true [2024-11-27 19:51:50,646 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse2 (= .cse0 .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (or (= .cse1 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0))))) is different from false [2024-11-27 19:51:50,650 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse2 (= .cse0 .cse5))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (or (= .cse1 0) .cse2) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse3 (select |v_#valid_BEFORE_CALL_19| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0))))) is different from true [2024-11-27 19:51:50,703 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-11-27 19:51:50,704 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 151 treesize of output 93 [2024-11-27 19:51:50,712 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 19:51:50,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:50,743 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-27 19:51:50,743 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 222 treesize of output 147 [2024-11-27 19:51:50,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:50,756 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 74 treesize of output 68 [2024-11-27 19:51:50,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:50,767 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 62 [2024-11-27 19:51:50,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:50,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2024-11-27 19:51:50,790 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 40 treesize of output 35 [2024-11-27 19:51:50,870 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse4 (= .cse1 .cse0))) (and (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_old(#valid)_AFTER_CALL_26| .cse2))) |v_old(#valid)_AFTER_CALL_26|))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse3 4)) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse3 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse6) 1)))))))) is different from false [2024-11-27 19:51:50,873 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse4 (= .cse1 .cse0))) (and (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_old(#valid)_AFTER_CALL_26| .cse2))) |v_old(#valid)_AFTER_CALL_26|))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse3 4)) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse3 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse6) 1)))))))) is different from true [2024-11-27 19:51:50,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:50,913 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 140 treesize of output 92 [2024-11-27 19:51:50,930 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 19:51:50,930 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-27 19:51:50,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.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 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or (= .cse2 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1))) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse2 4)) 0)))) is different from false [2024-11-27 19:51:50,984 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.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 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or (= .cse2 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1))) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse2 4)) 0)))) is different from true [2024-11-27 19:51:51,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2024-11-27 19:51:51,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:51,095 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-27 19:51:51,139 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 1))) (= (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-27 19:51:51,142 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 1))) (= (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-27 19:51:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2024-11-27 19:51:51,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:52,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1815 Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| Int) (v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (v_ArrVal_1825 (Array Int Int)) (v_ArrVal_1812 Int) (v_ArrVal_1814 (Array Int Int))) (let ((.cse6 (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$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_1826)) (.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_1827) .cse6) .cse7))) (let ((.cse4 (select .cse5 .cse0)) (.cse1 (+ (select (select .cse5 .cse6) .cse7) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_1825) .cse0) .cse1 v_ArrVal_1812)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_1811) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1814) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_1808) .cse2) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store .cse4 .cse1 v_ArrVal_1815)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_1809) .cse2) .cse3)))) (not (= (select .cse4 .cse1) 0)) (< 0 v_ArrVal_1815) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39|) 0))))))) is different from false [2024-11-27 19:51:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288345841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:52,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 52 [2024-11-27 19:51:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833034103] [2024-11-27 19:51:52,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-27 19:51:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:52,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-27 19:51:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1657, Unknown=68, NotChecked=1900, Total=3782 [2024-11-27 19:51:52,569 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 52 states, 50 states have (on average 1.44) internal successors, (72), 43 states have internal predecessors, (72), 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-27 19:51:53,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse3 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 (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= (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)))) is different from false [2024-11-27 19:51:53,216 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse3 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 (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= (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)))) is different from true [2024-11-27 19:51:53,221 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |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) (or .cse1 (= .cse2 1) (exists ((|v_#memory_int#1_243| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_243| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_243|))) (and (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_243| (store |v_#memory_int#1_BEFORE_CALL_6| .cse4 (select |v_#memory_int#1_243| .cse4))))))))) (not .cse1) (= (select .cse3 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (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-27 19:51:53,225 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |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) (or .cse1 (= .cse2 1) (exists ((|v_#memory_int#1_243| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_243| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_243|))) (and (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_243| (store |v_#memory_int#1_BEFORE_CALL_6| .cse4 (select |v_#memory_int#1_243| .cse4))))))))) (not .cse1) (= (select .cse3 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (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-27 19:51:53,228 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)) (.cse4 (select (select |c_#memory_int#1| .cse2) 0))) (and (or .cse0 .cse1) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |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) (= |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-27 19:51:53,230 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)) (.cse4 (select (select |c_#memory_int#1| .cse2) 0))) (and (or .cse0 .cse1) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |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) (= |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-27 19:51:53,234 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_int#1| .cse0) 0)) (.cse4 (= (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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (not .cse2) (or .cse2 (= .cse3 1)) (or .cse2 .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) .cse4 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-27 19:51:53,236 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_int#1| .cse0) 0)) (.cse4 (= (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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (not .cse2) (or .cse2 (= .cse3 1)) (or .cse2 .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) .cse4 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-27 19:51:53,243 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))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse4 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_int#1| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse4) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse2 .cse4) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3)))) is different from false [2024-11-27 19:51:53,245 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))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse4 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_int#1| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse4) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse2 .cse4) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3)))) is different from true [2024-11-27 19:51:53,249 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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (= |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-27 19:51:53,251 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) (exists ((|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_18| |c_#valid|))) (store |v_#valid_BEFORE_CALL_18| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_18| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (= |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-27 19:51:53,257 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 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-27 19:51:53,259 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse0 (select |v_#valid_BEFORE_CALL_19| .cse0)))) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse1) 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-27 19:51:53,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse5 (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2)))) (let ((.cse6 (@diff .cse5 |c_#memory_int#1|))) (let ((.cse3 (store .cse5 .cse6 (select |c_#memory_int#1| .cse6)))) (let ((.cse4 (@diff .cse3 |c_#memory_int#1|)) (.cse9 (@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|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#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))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse2) 0)) (or (= |c_#memory_int#1| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_int#1| (store .cse3 .cse4 (select |c_#memory_int#1| .cse4))) (or (= |c_#memory_int#1| .cse5) (= (select |c_old(#valid)| .cse6) 0)) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1)))) (= |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)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse1 0)))))))) is different from false [2024-11-27 19:51:53,273 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse5 (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2)))) (let ((.cse6 (@diff .cse5 |c_#memory_int#1|))) (let ((.cse3 (store .cse5 .cse6 (select |c_#memory_int#1| .cse6)))) (let ((.cse4 (@diff .cse3 |c_#memory_int#1|)) (.cse9 (@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|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#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))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse2) 0)) (or (= |c_#memory_int#1| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_int#1| (store .cse3 .cse4 (select |c_#memory_int#1| .cse4))) (or (= |c_#memory_int#1| .cse5) (= (select |c_old(#valid)| .cse6) 0)) (exists ((v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_18| v_arrayElimCell_90) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1)))) (= |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)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse1 0)))))))) is different from true [2024-11-27 19:51:53,288 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 ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (= .cse2 .cse4)) (.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|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse3) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2024-11-27 19:51:53,292 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 ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (= .cse2 .cse4)) (.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|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse3) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2024-11-27 19:51:53,300 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 ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (= .cse2 .cse4)) (.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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 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 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse3) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_old(#valid)_AFTER_CALL_26| .cse7))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2024-11-27 19:51:53,305 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 ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse3 (= .cse2 .cse4)) (.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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 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 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse3) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse7 (select |v_old(#valid)_AFTER_CALL_26| .cse7))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2024-11-27 19:51:53,319 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (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 (= .cse4 .cse1))) (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) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 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)) (= |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)) (= |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) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_old(#valid)_AFTER_CALL_26| .cse8))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from false [2024-11-27 19:51:53,324 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (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 (= .cse4 .cse1))) (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) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 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)) (= |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)) (= |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) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_old(#valid)_AFTER_CALL_26| .cse8))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from true [2024-11-27 19:51:53,339 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (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 (= .cse4 .cse1))) (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) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 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)) (= |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)) (= |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) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_old(#valid)_AFTER_CALL_26| .cse8))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from false [2024-11-27 19:51:53,343 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (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 (= .cse4 .cse1))) (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) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 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)) (= |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)) (= |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) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_old(#valid)_AFTER_CALL_26| .cse8))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from true [2024-11-27 19:51:53,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse4 (= .cse2 .cse7)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .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) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (or (= .cse3 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_old(#valid)_AFTER_CALL_26| .cse8))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from false [2024-11-27 19:51:53,361 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse4 (= .cse2 .cse7)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .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) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (or (= .cse3 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_19| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse8 (select |v_old(#valid)_AFTER_CALL_26| .cse8))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from true [2024-11-27 19:51:53,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (.cse5 (= .cse2 .cse8)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .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_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse5) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= .cse3 0)) (or (= .cse4 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from false [2024-11-27 19:51:53,380 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (.cse5 (= .cse2 .cse8)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .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_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse5) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= .cse3 0)) (or (= .cse4 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))))) is different from true [2024-11-27 19:51:53,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (.cse4 (= .cse2 .cse8)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .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) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= .cse5 0)) (or (= .cse3 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 0)))))) is different from false [2024-11-27 19:51:53,398 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4)) (.cse4 (= .cse2 .cse8)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .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) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (not (= .cse5 0)) (or (= .cse3 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_19| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse7) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse2) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 0)))))) is different from true [2024-11-27 19:51:53,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse9 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse5 (= .cse1 .cse0)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_old(#valid)_AFTER_CALL_26| .cse2))) |v_old(#valid)_AFTER_CALL_26|))) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse4 4)) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0)))))) is different from false [2024-11-27 19:51:53,414 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse9 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse5 (= .cse1 .cse0)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_18| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse2 (select |v_old(#valid)_AFTER_CALL_26| .cse2))) |v_old(#valid)_AFTER_CALL_26|))) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse4 4)) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 0) .cse5) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_19| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= |v_#valid_BEFORE_CALL_19| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_21| |v_#valid_BEFORE_CALL_19|))) (store |v_#valid_BEFORE_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_19| .cse7)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_21| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_21| v_arrayElimCell_90) 1) (= (select |v_#valid_BEFORE_CALL_19| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0)))))) is different from true [2024-11-27 19:51:53,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (= .cse5 0)) (.cse0 (= .cse4 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse4) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= .cse1 1)) .cse2 (or .cse2 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse4) (+ .cse5 4)) 0)))) is different from false [2024-11-27 19:51:53,420 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (= .cse5 0)) (.cse0 (= .cse4 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse4) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= .cse1 1)) .cse2 (or .cse2 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_#valid_BEFORE_CALL_18| .cse4) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (<= (select (select |c_#memory_$Pointer$#1.offset| .cse4) (+ .cse5 4)) 0)))) is different from true [2024-11-27 19:51:53,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 1))) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2024-11-27 19:51:53,426 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_23| Int)) (and (= (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0) (= (select |v_#valid_BEFORE_CALL_18| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_18| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_18| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_23|) 1))) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2024-11-27 19:51:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:53,693 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-27 19:51:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-27 19:51:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.44) internal successors, (72), 43 states have internal predecessors, (72), 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 47 [2024-11-27 19:51:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:53,695 INFO L225 Difference]: With dead ends: 86 [2024-11-27 19:51:53,695 INFO L226 Difference]: Without dead ends: 84 [2024-11-27 19:51:53,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=215, Invalid=1988, Unknown=107, NotChecked=4662, Total=6972 [2024-11-27 19:51:53,697 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2074 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:53,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 478 Invalid, 2558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 480 Invalid, 0 Unknown, 2074 Unchecked, 0.5s Time] [2024-11-27 19:51:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-27 19:51:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-27 19:51:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 75 states have internal predecessors, (83), 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-27 19:51:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-27 19:51:53,717 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 47 [2024-11-27 19:51:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:53,717 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-27 19:51:53,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.44) internal successors, (72), 43 states have internal predecessors, (72), 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-27 19:51:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-27 19:51:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 19:51:53,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:53,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:53,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-27 19:51:53,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash -67713656, now seen corresponding path program 1 times [2024-11-27 19:51:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377577311] [2024-11-27 19:51:53,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377577311] [2024-11-27 19:51:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377577311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197221919] [2024-11-27 19:51:56,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:56,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:56,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:56,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:56,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 19:51:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:57,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-27 19:51:57,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:57,120 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-27 19:51:57,330 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_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from false [2024-11-27 19:51:57,332 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_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from true [2024-11-27 19:51:57,341 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-27 19:51:57,346 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-27 19:51:57,364 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|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= (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-27 19:51:57,366 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|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= (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-27 19:51:57,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 19:51:57,396 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-27 19:51:57,415 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-27 19:51:57,416 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-27 19:51:57,437 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_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))))) is different from false [2024-11-27 19:51:57,440 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_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))))) is different from true [2024-11-27 19:51:57,471 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) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))))) is different from false [2024-11-27 19:51:57,473 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) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))))) is different from true [2024-11-27 19:51:57,517 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))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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) (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from false [2024-11-27 19:51:57,519 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))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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) (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from true [2024-11-27 19:51:57,561 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|) (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= |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-27 19:51:57,563 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|) (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= |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-27 19:51:57,577 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-27 19:51:57,583 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-27 19:51:57,612 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (= |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-27 19:51:57,615 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (= |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-27 19:51:57,655 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (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-27 19:51:57,658 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (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-27 19:51:57,734 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 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-27 19:51:57,737 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 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-27 19:51:57,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:57,800 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-27 19:51:57,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:57,809 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-27 19:51:57,882 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))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 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) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_24| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 1))) (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-27 19:51:57,886 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 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) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_24| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 1))) (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-27 19:51:57,973 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 ((.cse3 (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) (= |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 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_24| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-27 19:51:57,977 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 ((.cse3 (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) (= |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 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_24| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-27 19:51:58,083 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 ((.cse3 (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_~new_last~0#1.offset| 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_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse2) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse3 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) is different from false [2024-11-27 19:51:58,087 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 ((.cse3 (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_~new_last~0#1.offset| 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_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse2) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse3 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) is different from true [2024-11-27 19:51:58,280 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$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse2) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (or (= .cse3 0) (= .cse0 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_old(#valid)_AFTER_CALL_29| .cse5))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) is different from false [2024-11-27 19:51:58,283 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$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse2) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (or (= .cse3 0) (= .cse0 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_old(#valid)_AFTER_CALL_29| .cse5))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) is different from true [2024-11-27 19:51:58,382 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 ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (or (= .cse4 0) (= .cse1 .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) is different from false [2024-11-27 19:51:58,386 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 ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (or (= .cse4 0) (= .cse1 .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) is different from true [2024-11-27 19:51:58,462 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (or (= .cse4 0) (= .cse1 .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0)))) is different from false [2024-11-27 19:51:58,466 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (or (= .cse4 0) (= .cse1 .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0)))) is different from true [2024-11-27 19:51:58,513 INFO L349 Elim1Store]: treesize reduction 77, result has 12.5 percent of original size [2024-11-27 19:51:58,513 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 110 [2024-11-27 19:51:58,543 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-27 19:51:58,543 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 257 treesize of output 188 [2024-11-27 19:51:58,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:58,550 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 127 [2024-11-27 19:51:58,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:58,577 INFO L349 Elim1Store]: treesize reduction 100, result has 18.7 percent of original size [2024-11-27 19:51:58,578 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 158 treesize of output 136 [2024-11-27 19:51:58,616 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse1 (+ .cse4 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (or (= .cse4 0) (= .cse0 .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (not (= .cse7 0))))))) is different from false [2024-11-27 19:51:58,620 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 ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse1 (+ .cse4 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (or (= .cse4 0) (= .cse0 .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (not (= .cse7 0))))))) is different from true [2024-11-27 19:51:58,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:58,651 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 162 treesize of output 110 [2024-11-27 19:51:58,664 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 19:51:58,665 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-27 19:51:58,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse4 (+ .cse3 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1))) (or (= .cse3 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4) 0) (not (= 0 .cse1)))))) is different from false [2024-11-27 19:51:58,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse4 (+ .cse3 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1))) (or (= .cse3 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4) 0) (not (= 0 .cse1)))))) is different from true [2024-11-27 19:51:58,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:58,780 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 52 [2024-11-27 19:51:58,832 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) |v_old(#valid)_AFTER_CALL_29|) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0)))))) is different from false [2024-11-27 19:51:58,834 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) |v_old(#valid)_AFTER_CALL_29|) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0)))))) is different from true [2024-11-27 19:51:58,886 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 19:51:58,886 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-27 19:51:58,902 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_20 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_20) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from false [2024-11-27 19:52:03,186 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_20 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_20) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from true [2024-11-27 19:52:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2024-11-27 19:52:03,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:52:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197221919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:05,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:52:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 53 [2024-11-27 19:52:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011949935] [2024-11-27 19:52:05,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:52:05,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-27 19:52:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:52:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-27 19:52:05,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1769, Unknown=41, NotChecked=1938, Total=3906 [2024-11-27 19:52:05,915 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 53 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 44 states have internal predecessors, (75), 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-27 19:52:07,067 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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= |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-27 19:52:07,072 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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= |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-27 19:52:07,078 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|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= (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-27 19:52:07,084 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|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= (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-27 19:52:07,090 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) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3)))))) .cse1))) is different from false [2024-11-27 19:52:07,096 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) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3)))))) .cse1))) is different from true [2024-11-27 19:52:07,102 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_$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) .cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3))))))))) is different from false [2024-11-27 19:52:07,108 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_$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) .cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3))))))))) is different from true [2024-11-27 19:52:07,117 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))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse1) 1)))) is different from false [2024-11-27 19:52:07,122 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))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse1) 1)))) is different from true [2024-11-27 19:52:07,129 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)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (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) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (not (= .cse0 .cse1)) (= (select |c_#valid| .cse2) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 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| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-27 19:52:07,134 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)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (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) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (not (= .cse0 .cse1)) (= (select |c_#valid| .cse2) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 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| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-27 19:52:07,142 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (not (= |c_node_create_~temp~0#1.base| 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-27 19:52:07,147 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (not (= |c_node_create_~temp~0#1.base| 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-27 19:52:07,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@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|))) (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (= |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)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (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)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-27 19:52:07,161 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@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|))) (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_114 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 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_114) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|)))) (= |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)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (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)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-27 19:52:07,172 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)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) 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|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (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_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse6 .cse5)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-27 19:52:07,179 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)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) 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|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (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_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse6 .cse5)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-27 19:52:07,193 WARN L851 $PredicateComparison]: unable to prove that (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|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (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| .cse0) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse5 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |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_~head#1.offset| 0)))) is different from false [2024-11-27 19:52:07,200 WARN L873 $PredicateComparison]: unable to prove that (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|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (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| .cse0) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse5 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_old(#valid)_AFTER_CALL_29| .cse6))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |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_~head#1.offset| 0)))) is different from true [2024-11-27 19:52:07,214 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)) (.cse6 (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_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse6 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_old(#valid)_AFTER_CALL_29| .cse7))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from false [2024-11-27 19:52:07,221 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)) (.cse6 (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_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse6 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_old(#valid)_AFTER_CALL_29| .cse7))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from true [2024-11-27 19:52:07,235 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)) (.cse6 (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_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse6 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_old(#valid)_AFTER_CALL_29| .cse7))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0))))) is different from false [2024-11-27 19:52:07,242 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)) (.cse6 (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_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse6 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_old(#valid)_AFTER_CALL_29| .cse7))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0))))) is different from true [2024-11-27 19:52:07,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4))) (and (= (select .cse0 0) 0) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (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| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (and .cse1 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse6 0) (= .cse3 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_old(#valid)_AFTER_CALL_29| .cse8))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from false [2024-11-27 19:52:07,263 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4))) (and (= (select .cse0 0) 0) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (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| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (and .cse1 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse6 0) (= .cse3 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_old(#valid)_AFTER_CALL_29| .cse8))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from true [2024-11-27 19:52:07,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse12 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4)) (.cse2 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse3 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse9) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) .cse2 (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (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| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_24| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse6) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select .cse7 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse8 0) (= .cse4 .cse9)) (or (let ((.cse10 (select .cse7 4))) (and .cse2 (= .cse10 |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|) (not (= .cse10 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse11 (select |v_old(#valid)_AFTER_CALL_29| .cse11))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from false [2024-11-27 19:52:07,286 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse12 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4)) (.cse2 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse3 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse9) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) .cse2 (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (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| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_24| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse6) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select .cse7 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse8) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse8 0) (= .cse4 .cse9)) (or (let ((.cse10 (select .cse7 4))) (and .cse2 (= .cse10 |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|) (not (= .cse10 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse11 (select |v_old(#valid)_AFTER_CALL_29| .cse11))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) is different from true [2024-11-27 19:52:07,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2) 0) (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| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse6) (= |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 (= .cse6 0) (= .cse3 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_old(#valid)_AFTER_CALL_29| .cse8))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2) 0))))) is different from false [2024-11-27 19:52:07,306 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2) 0) (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| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse6) (= |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 (= .cse6 0) (= .cse3 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_old(#valid)_AFTER_CALL_29| .cse8))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2) 0))))) is different from true [2024-11-27 19:52:07,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse10 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse2 (+ .cse6 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= (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| .cse3) 4)) 4) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (or (= .cse6 0) (= .cse1 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_old(#valid)_AFTER_CALL_29| .cse8))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1))) (not (= .cse9 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0))))))) is different from false [2024-11-27 19:52:07,326 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse10 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse2 (+ .cse6 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= (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| .cse3) 4)) 4) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_114 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 |v_old(#valid)_AFTER_CALL_30| v_arrayElimCell_114) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_30| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1)))) (or (= .cse6 0) (= .cse1 .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_old(#valid)_AFTER_CALL_29| .cse8))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_29| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1))) (not (= .cse9 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0))))))) is different from true [2024-11-27 19:52:07,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse5 (+ .cse6 4))) (let ((.cse4 (= .cse6 0)) (.cse1 (select .cse3 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1))) (not (= (select .cse3 4) 0)) .cse4 (or .cse4 (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5) 0) (not (= 0 .cse1)))))) is different from false [2024-11-27 19:52:07,339 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse5 (+ .cse6 4))) (let ((.cse4 (= .cse6 0)) (.cse1 (select .cse3 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 1))) (not (= (select .cse3 4) 0)) .cse4 (or .cse4 (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5) 0) (not (= 0 .cse1)))))) is different from true [2024-11-27 19:52:07,346 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) |v_old(#valid)_AFTER_CALL_29|) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2024-11-27 19:52:07,351 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) |v_old(#valid)_AFTER_CALL_29|) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2024-11-27 19:52:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:11,554 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2024-11-27 19:52:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-27 19:52:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 44 states have internal predecessors, (75), 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 49 [2024-11-27 19:52:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:11,555 INFO L225 Difference]: With dead ends: 128 [2024-11-27 19:52:11,555 INFO L226 Difference]: Without dead ends: 125 [2024-11-27 19:52:11,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=271, Invalid=2880, Unknown=77, NotChecked=5328, Total=8556 [2024-11-27 19:52:11,557 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 4101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3100 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:11,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 651 Invalid, 4101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 987 Invalid, 0 Unknown, 3100 Unchecked, 3.4s Time] [2024-11-27 19:52:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-27 19:52:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-11-27 19:52:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.1111111111111112) internal successors, (100), 90 states have internal predecessors, (100), 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-27 19:52:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-27 19:52:11,581 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 49 [2024-11-27 19:52:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:11,582 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-27 19:52:11,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 44 states have internal predecessors, (75), 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-27 19:52:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-27 19:52:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 19:52:11,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:11,583 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-11-27 19:52:11,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 19:52:11,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 19:52:11,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:52:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2099194206, now seen corresponding path program 2 times [2024-11-27 19:52:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253167548] [2024-11-27 19:52:11,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:52:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:11,849 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:52:11,849 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:52:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:52:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:52:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253167548] [2024-11-27 19:52:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253167548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576305964] [2024-11-27 19:52:18,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:52:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:52:18,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:52:18,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:52:18,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d56bdb4c-58b2-467e-98c1-f0879a63e23f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 19:52:18,293 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:52:18,293 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:52:18,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 165 conjuncts are in the unsatisfiable core [2024-11-27 19:52:18,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:52:18,521 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-27 19:52:18,804 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-27 19:52:18,823 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-27 19:52:19,925 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:52:19,925 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-27 19:52:20,001 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:52:20,001 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-27 19:52:20,108 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:52:20,109 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-27 19:52:20,412 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-27 19:52:20,432 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-27 19:52:20,461 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-27 19:52:20,475 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-27 19:52:20,782 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 19:52:20,782 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 86 treesize of output 59 [2024-11-27 19:52:20,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-27 19:52:22,249 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 19:52:22,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 45 [2024-11-27 19:52:22,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-27 19:52:22,271 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-27 19:52:22,897 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-27 19:52:23,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:23,367 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-27 19:52:23,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 76 [2024-11-27 19:52:23,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:23,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:23,481 INFO L349 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2024-11-27 19:52:23,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 65 [2024-11-27 19:52:23,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:23,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:23,583 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-27 19:52:23,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-11-27 19:52:26,788 INFO L349 Elim1Store]: treesize reduction 324, result has 26.7 percent of original size [2024-11-27 19:52:26,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 179 treesize of output 162 [2024-11-27 19:52:26,992 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-27 19:52:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 109 [2024-11-27 19:52:27,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2024-11-27 19:52:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:27,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:27,377 INFO L349 Elim1Store]: treesize reduction 258, result has 24.1 percent of original size [2024-11-27 19:52:27,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 97 [2024-11-27 19:52:27,417 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 19:52:27,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2024-11-27 19:52:27,530 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 11 [2024-11-27 19:52:31,124 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 1568 treesize of output 1436 [2024-11-27 19:58:33,211 WARN L286 SmtUtils]: Spent 5.83m on a formula simplification. DAG size of input: 4589 DAG size of output: 4465 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 19:58:33,215 INFO L349 Elim1Store]: treesize reduction 296, result has 97.8 percent of original size [2024-11-27 19:58:33,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 66 select indices, 66 select index equivalence classes, 1 disjoint index pairs (out of 2145 index pairs), introduced 86 new quantified variables, introduced 2145 case distinctions, treesize of input 1896 treesize of output 14088 [2024-11-27 19:58:51,119 INFO L224 Elim1Store]: Index analysis took 8634 ms