./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/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_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/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_54f19277-6d97-4361-ace0-33abb2f8f34e/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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:23:54,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:23:54,372 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:23:54,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:23:54,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:23:54,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:23:54,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:23:54,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:23:54,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:23:54,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:23:54,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:23:54,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:23:54,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:23:54,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:23:54,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:23:54,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:23:54,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:23:54,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:23:54,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:23:54,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:23:54,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:23:54,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:23:54,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:23:54,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:23:54,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:23:54,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:23:54,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:23:54,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:23:54,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:23:54,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:23:54,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:23:54,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:23:54,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:23:54,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:23:54,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:23:54,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:23:54,430 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_54f19277-6d97-4361-ace0-33abb2f8f34e/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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-27 23:23:54,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:23:54,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:23:54,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:23:54,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:23:54,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:23:54,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-27 23:23:57,771 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/bee1fc24d/0b487fb98cb142d69c299f5a6bbacfd1/FLAG2215ad07c [2024-11-27 23:23:58,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:23:58,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-27 23:23:58,138 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/bee1fc24d/0b487fb98cb142d69c299f5a6bbacfd1/FLAG2215ad07c [2024-11-27 23:23:58,157 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/bee1fc24d/0b487fb98cb142d69c299f5a6bbacfd1 [2024-11-27 23:23:58,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:23:58,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:23:58,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:23:58,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:23:58,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:23:58,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635647da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58, skipping insertion in model container [2024-11-27 23:23:58,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:23:58,540 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_54f19277-6d97-4361-ace0-33abb2f8f34e/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-27 23:23:58,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:23:58,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:23:58,621 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_54f19277-6d97-4361-ace0-33abb2f8f34e/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-27 23:23:58,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:23:58,660 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:23:58,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58 WrapperNode [2024-11-27 23:23:58,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:23:58,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:23:58,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:23:58,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:23:58,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,714 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 182 [2024-11-27 23:23:58,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:23:58,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:23:58,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:23:58,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:23:58,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,775 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-27 23:23:58,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:23:58,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:23:58,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:23:58,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:23:58,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (1/1) ... [2024-11-27 23:23:58,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:23:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:23:58,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:23:58,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:23:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 23:23:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 23:23:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 23:23:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 23:23:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 23:23:58,902 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:23:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:23:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:23:58,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 23:23:58,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:23:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:23:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:23:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:23:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:23:59,112 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:23:59,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:23:59,581 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-27 23:23:59,581 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:23:59,591 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:23:59,592 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 23:23:59,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:23:59 BoogieIcfgContainer [2024-11-27 23:23:59,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:23:59,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:23:59,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:23:59,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:23:59,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:23:58" (1/3) ... [2024-11-27 23:23:59,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5646349e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:23:59, skipping insertion in model container [2024-11-27 23:23:59,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:23:58" (2/3) ... [2024-11-27 23:23:59,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5646349e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:23:59, skipping insertion in model container [2024-11-27 23:23:59,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:23:59" (3/3) ... [2024-11-27 23:23:59,603 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-27 23:23:59,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:23:59,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 44 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 23:23:59,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:23:59,692 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;@3d4e83e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:23:59,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:23:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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 23:23:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 23:23:59,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:23:59,704 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] [2024-11-27 23:23:59,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:23:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:23:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1272870556, now seen corresponding path program 1 times [2024-11-27 23:23:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:23:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43013302] [2024-11-27 23:23:59,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:23:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:23:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:24:00,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43013302] [2024-11-27 23:24:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43013302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:24:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:24:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:24:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921542114] [2024-11-27 23:24:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:24:00,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:24:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:00,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:24:00,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:24:00,094 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 23:24:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:00,121 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-27 23:24:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:24:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-27 23:24:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:00,132 INFO L225 Difference]: With dead ends: 79 [2024-11-27 23:24:00,133 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 23:24:00,138 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 23:24:00,144 INFO L435 NwaCegarLoop]: 58 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, 58 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 23:24:00,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:24:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 23:24:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-27 23:24:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 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 23:24:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-27 23:24:00,241 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-27 23:24:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-27 23:24:00,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 23:24:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-27 23:24:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 23:24:00,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:00,247 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] [2024-11-27 23:24:00,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:24:00,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:00,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1190653912, now seen corresponding path program 1 times [2024-11-27 23:24:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708907638] [2024-11-27 23:24:00,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:24:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708907638] [2024-11-27 23:24:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708907638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:24:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:24:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:24:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569631758] [2024-11-27 23:24:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:24:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:24:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:00,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:24:00,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:24:00,719 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23:24:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:00,740 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-11-27 23:24:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:24:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2024-11-27 23:24:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:00,742 INFO L225 Difference]: With dead ends: 66 [2024-11-27 23:24:00,743 INFO L226 Difference]: Without dead ends: 40 [2024-11-27 23:24:00,743 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 23:24:00,744 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 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 23:24:00,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:24:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-27 23:24:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-27 23:24:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 23:24:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-27 23:24:00,752 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2024-11-27 23:24:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:00,753 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-27 23:24:00,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23:24:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-27 23:24:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 23:24:00,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:00,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:00,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:24:00,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:00,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash -611656201, now seen corresponding path program 1 times [2024-11-27 23:24:00,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:00,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132883822] [2024-11-27 23:24:00,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132883822] [2024-11-27 23:24:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132883822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:24:01,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:24:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:24:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244891458] [2024-11-27 23:24:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:24:01,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:24:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:01,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:24:01,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:24:01,020 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 23:24:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:01,061 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2024-11-27 23:24:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:24:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-27 23:24:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:01,064 INFO L225 Difference]: With dead ends: 51 [2024-11-27 23:24:01,066 INFO L226 Difference]: Without dead ends: 39 [2024-11-27 23:24:01,066 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 23:24:01,067 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 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 23:24:01,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:24:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-27 23:24:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-27 23:24:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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 23:24:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-27 23:24:01,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 35 [2024-11-27 23:24:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:01,081 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-27 23:24:01,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 23:24:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-27 23:24:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:24:01,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:01,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:01,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:24:01,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:01,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash -169874309, now seen corresponding path program 1 times [2024-11-27 23:24:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:01,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689528409] [2024-11-27 23:24:01,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:01,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:24:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689528409] [2024-11-27 23:24:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689528409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324413704] [2024-11-27 23:24:05,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:24:05,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:24:05,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:24:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:06,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-27 23:24:06,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:24:06,476 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 23:24:06,812 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 23:24:06,950 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:24:06,950 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 23:24:07,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 23:24:07,087 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 23:24:07,221 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 23:24:07,221 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 57 treesize of output 50 [2024-11-27 23:24:07,238 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 23:24:07,531 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-27 23:24:07,531 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 94 treesize of output 48 [2024-11-27 23:24:07,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:24:07,546 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 30 treesize of output 27 [2024-11-27 23:24:07,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-27 23:24:07,932 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-27 23:24:07,932 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 49 treesize of output 24 [2024-11-27 23:24:07,944 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 23:24:07,952 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 23:24:08,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:24:08,326 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 23:24:08,326 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 57 treesize of output 46 [2024-11-27 23:24:08,357 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:24:08,357 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 23:24:08,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 23:24:08,773 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-27 23:24:08,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2024-11-27 23:24:08,984 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-27 23:24:08,992 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 23:24:09,105 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 23:24:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:24:09,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:24:22,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324413704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:22,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:24:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2024-11-27 23:24:22,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705177983] [2024-11-27 23:24:22,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:24:22,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-27 23:24:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:22,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-27 23:24:22,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2428, Unknown=53, NotChecked=0, Total=2652 [2024-11-27 23:24:22,284 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 37 states have internal predecessors, (58), 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 23:24:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:25,943 INFO L93 Difference]: Finished difference Result 103 states and 141 transitions. [2024-11-27 23:24:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-27 23:24:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 37 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-27 23:24:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:25,946 INFO L225 Difference]: With dead ends: 103 [2024-11-27 23:24:25,946 INFO L226 Difference]: Without dead ends: 101 [2024-11-27 23:24:25,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=376, Invalid=5120, Unknown=54, NotChecked=0, Total=5550 [2024-11-27 23:24:25,949 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 111 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:24:25,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 531 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-27 23:24:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-27 23:24:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2024-11-27 23:24:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:24:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-11-27 23:24:25,962 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 37 [2024-11-27 23:24:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:25,962 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-11-27 23:24:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 37 states have internal predecessors, (58), 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 23:24:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-11-27 23:24:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:24:25,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:25,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:25,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:24:26,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:26,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2088635427, now seen corresponding path program 1 times [2024-11-27 23:24:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456650652] [2024-11-27 23:24:26,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456650652] [2024-11-27 23:24:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456650652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:24:26,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:24:26,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:24:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468669794] [2024-11-27 23:24:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:24:26,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:24:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:26,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:24:26,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:24:26,351 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:24:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:26,386 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2024-11-27 23:24:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:24:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-27 23:24:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:26,388 INFO L225 Difference]: With dead ends: 80 [2024-11-27 23:24:26,389 INFO L226 Difference]: Without dead ends: 65 [2024-11-27 23:24:26,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:24:26,390 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:24:26,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 89 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:24:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-27 23:24:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-27 23:24:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:24:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-27 23:24:26,410 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2024-11-27 23:24:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:26,410 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-27 23:24:26,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:24:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-27 23:24:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:24:26,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:26,414 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:24:26,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -819238401, now seen corresponding path program 2 times [2024-11-27 23:24:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450786774] [2024-11-27 23:24:26,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:24:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:26,474 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:24:26,474 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:24:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 23:24:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:26,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450786774] [2024-11-27 23:24:26,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450786774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:26,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659239681] [2024-11-27 23:24:26,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:24:26,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:26,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:24:26,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:24:26,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:24:27,049 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:24:27,049 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:24:27,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 23:24:27,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:24:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:27,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:24:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659239681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:24:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:24:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-27 23:24:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644002860] [2024-11-27 23:24:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:24:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:24:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:27,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:24:27,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:24:27,110 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:24:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:27,155 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2024-11-27 23:24:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:24:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-27 23:24:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:27,157 INFO L225 Difference]: With dead ends: 82 [2024-11-27 23:24:27,157 INFO L226 Difference]: Without dead ends: 65 [2024-11-27 23:24:27,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:24:27,158 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 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 23:24:27,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:24:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-27 23:24:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-27 23:24:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:24:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-27 23:24:27,173 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 39 [2024-11-27 23:24:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:27,173 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-27 23:24:27,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:24:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-27 23:24:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:24:27,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:27,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:27,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:24:27,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:27,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1556967777, now seen corresponding path program 1 times [2024-11-27 23:24:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:27,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750940208] [2024-11-27 23:24:27,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:27,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:27,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750940208] [2024-11-27 23:24:27,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750940208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593423144] [2024-11-27 23:24:27,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:27,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:24:27,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:24:27,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:24:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:27,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-27 23:24:27,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:24:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:27,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:24:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593423144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:24:27,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:24:27,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-27 23:24:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892630395] [2024-11-27 23:24:27,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:24:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:24:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:27,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:24:27,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:24:27,958 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 23:24:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:28,099 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2024-11-27 23:24:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:24:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-27 23:24:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:28,100 INFO L225 Difference]: With dead ends: 76 [2024-11-27 23:24:28,100 INFO L226 Difference]: Without dead ends: 63 [2024-11-27 23:24:28,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:24:28,101 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:24:28,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:24:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-27 23:24:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-27 23:24:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:24:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2024-11-27 23:24:28,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 39 [2024-11-27 23:24:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:28,123 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2024-11-27 23:24:28,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 23:24:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2024-11-27 23:24:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:24:28,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:28,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:28,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 23:24:28,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:28,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:28,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1614226079, now seen corresponding path program 1 times [2024-11-27 23:24:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144629457] [2024-11-27 23:24:28,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 23:24:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144629457] [2024-11-27 23:24:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144629457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747303820] [2024-11-27 23:24:28,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:28,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:24:28,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:24:28,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:24:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:29,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-27 23:24:29,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:24:29,187 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 23:24:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:24:29,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:24:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 23:24:29,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747303820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:24:29,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:24:29,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 15 [2024-11-27 23:24:29,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863513463] [2024-11-27 23:24:29,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:24:29,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 23:24:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:29,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 23:24:29,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-27 23:24:29,301 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:24:33,358 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 23:24:37,392 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 23:24:41,406 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 23:24:45,458 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 23:24:49,755 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 23:24:53,778 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 23:24:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:53,785 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2024-11-27 23:24:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:24:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2024-11-27 23:24:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:53,786 INFO L225 Difference]: With dead ends: 116 [2024-11-27 23:24:53,786 INFO L226 Difference]: Without dead ends: 66 [2024-11-27 23:24:53,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-27 23:24:53,788 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:24:53,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 384 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 24.4s Time] [2024-11-27 23:24:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-27 23:24:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-27 23:24:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:24:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-11-27 23:24:53,801 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 39 [2024-11-27 23:24:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:53,802 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-11-27 23:24:53,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:24:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-11-27 23:24:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:24:53,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:53,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:53,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 23:24:54,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:54,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1253884835, now seen corresponding path program 1 times [2024-11-27 23:24:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893184679] [2024-11-27 23:24:54,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:54,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 23:24:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893184679] [2024-11-27 23:24:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893184679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43448247] [2024-11-27 23:24:54,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:54,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:54,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:24:54,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:24:54,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:24:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:54,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 23:24:54,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:24:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:54,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:24:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:24:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43448247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:24:54,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:24:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2024-11-27 23:24:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18682764] [2024-11-27 23:24:54,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:24:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 23:24:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:24:54,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 23:24:54,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:24:54,905 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-27 23:24:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:24:55,092 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-27 23:24:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:24:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 40 [2024-11-27 23:24:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:24:55,093 INFO L225 Difference]: With dead ends: 81 [2024-11-27 23:24:55,093 INFO L226 Difference]: Without dead ends: 70 [2024-11-27 23:24:55,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-11-27 23:24:55,094 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:24:55,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 303 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:24:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-27 23:24:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-11-27 23:24:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:24:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-27 23:24:55,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 40 [2024-11-27 23:24:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:24:55,114 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-27 23:24:55,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-27 23:24:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-27 23:24:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:24:55,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:24:55,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:24:55,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 23:24:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:55,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:24:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:24:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1253810373, now seen corresponding path program 1 times [2024-11-27 23:24:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:24:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71183750] [2024-11-27 23:24:55,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:24:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:24:58,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:24:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71183750] [2024-11-27 23:24:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71183750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:24:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311513983] [2024-11-27 23:24:58,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:24:58,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:24:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:24:58,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:24:58,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:24:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:24:58,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-27 23:24:58,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:24:58,680 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 23:24:58,930 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-11-27 23:24:58,934 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-11-27 23:24:58,963 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 23:24:58,972 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 23:24:58,985 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-27 23:24:58,988 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-27 23:24:59,048 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:24:59,048 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 23:24:59,074 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:24:59,074 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 23:24:59,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-27 23:24:59,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-27 23:24:59,117 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-27 23:24:59,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2024-11-27 23:24:59,171 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2024-11-27 23:24:59,302 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-27 23:24:59,303 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 105 treesize of output 51 [2024-11-27 23:24:59,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2024-11-27 23:24:59,328 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 16 treesize of output 15 [2024-11-27 23:24:59,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 27 [2024-11-27 23:24:59,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-27 23:24:59,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 23:24:59,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (select .cse0 4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) is different from false [2024-11-27 23:24:59,380 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (select .cse0 4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) is different from true [2024-11-27 23:24:59,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (select .cse2 4)) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (not (= .cse0 .cse1)) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)))) is different from false [2024-11-27 23:24:59,448 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (select .cse2 4)) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (not (= .cse0 .cse1)) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)))) is different from true [2024-11-27 23:24:59,472 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-27 23:24:59,472 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 57 treesize of output 24 [2024-11-27 23:24:59,485 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 23:24:59,517 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |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 23:24:59,520 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |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 23:24:59,569 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_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 23:24:59,572 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_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 23:24:59,654 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 23:24:59,663 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_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |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 23:24:59,666 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_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |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 23:24:59,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:24:59,794 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 23:24:59,794 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 65 treesize of output 54 [2024-11-27 23:24:59,818 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 23:24:59,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2024-11-27 23:24:59,832 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 27 treesize of output 23 [2024-11-27 23:24:59,914 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) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= (select .cse3 (select .cse4 4)) .cse0) (= (select .cse4 0) 0))) (and (exists ((v_arrayElimCell_43 Int)) (= .cse0 (select .cse3 v_arrayElimCell_43))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))))))) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)))) is different from false [2024-11-27 23:24:59,918 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) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= (select .cse3 (select .cse4 4)) .cse0) (= (select .cse4 0) 0))) (and (exists ((v_arrayElimCell_43 Int)) (= .cse0 (select .cse3 v_arrayElimCell_43))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))))))) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)))) is different from true [2024-11-27 23:25:00,061 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) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= .cse2 .cse3)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (or (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select .cse4 (select .cse5 4)) .cse2) (= (select .cse5 0) 0))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2) (exists ((v_arrayElimCell_43 Int)) (= .cse2 (select .cse4 v_arrayElimCell_43)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from false [2024-11-27 23:25:00,067 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) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= .cse2 .cse3)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (or (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select .cse4 (select .cse5 4)) .cse2) (= (select .cse5 0) 0))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2) (exists ((v_arrayElimCell_43 Int)) (= .cse2 (select .cse4 v_arrayElimCell_43)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from true [2024-11-27 23:25:00,291 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 ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse4 (select .cse6 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse4) (not (= .cse0 .cse1)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (and (= (select .cse5 (select .cse6 4)) .cse0) (= .cse4 0)) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (exists ((v_arrayElimCell_43 Int)) (= .cse0 (select .cse5 v_arrayElimCell_43)))))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))))) is different from false [2024-11-27 23:25:00,295 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 ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse4 (select .cse6 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse4) (not (= .cse0 .cse1)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (and (= (select .cse5 (select .cse6 4)) .cse0) (= .cse4 0)) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (exists ((v_arrayElimCell_43 Int)) (= .cse0 (select .cse5 v_arrayElimCell_43)))))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))))) is different from true [2024-11-27 23:25:00,564 INFO L349 Elim1Store]: treesize reduction 977, result has 0.1 percent of original size [2024-11-27 23:25:00,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 912 treesize of output 414 [2024-11-27 23:25:00,587 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2024-11-27 23:25:00,588 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 350 treesize of output 136 [2024-11-27 23:25:00,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:25:00,600 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:25:00,619 INFO L349 Elim1Store]: treesize reduction 131, result has 0.8 percent of original size [2024-11-27 23:25:00,619 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 4 case distinctions, treesize of input 582 treesize of output 243 [2024-11-27 23:25:00,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:25:00,630 WARN L200 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:25:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:25:00,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:25:00,665 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 97 treesize of output 34 [2024-11-27 23:25:00,783 INFO L349 Elim1Store]: treesize reduction 293, result has 15.6 percent of original size [2024-11-27 23:25:00,783 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 5 case distinctions, treesize of input 552 treesize of output 264 [2024-11-27 23:25:00,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:25:00,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 70 [2024-11-27 23:25:00,813 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 14 treesize of output 9 [2024-11-27 23:25:00,825 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 23:25:01,136 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 ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select .cse2 0) 0) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse3 (select .cse2 4))) (or (and (= .cse3 4) (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse5 0) 0) (= .cse6 .cse7) (= (select |v_#valid_BEFORE_CALL_8| .cse6) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_8| .cse8))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse5 4) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse6) 8)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))))))) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((v_arrayElimCell_52 Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse10 (select .cse11 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse10))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse9 0) 0) (= .cse10 .cse7) (= (select |v_#valid_BEFORE_CALL_8| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse9 4) 0) (= .cse4 (select .cse11 .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse10) 8)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4))))))) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_#valid_BEFORE_CALL_8| .cse12))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse4))))))))))) is different from false [2024-11-27 23:25:01,141 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 ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select .cse2 0) 0) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse3 (select .cse2 4))) (or (and (= .cse3 4) (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse5 0) 0) (= .cse6 .cse7) (= (select |v_#valid_BEFORE_CALL_8| .cse6) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_8| .cse8))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse5 4) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse6) 8)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))))))) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((v_arrayElimCell_52 Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse10 (select .cse11 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse10))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse9 0) 0) (= .cse10 .cse7) (= (select |v_#valid_BEFORE_CALL_8| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse9 4) 0) (= .cse4 (select .cse11 .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse10) 8)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4))))))) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_#valid_BEFORE_CALL_8| .cse12))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse4))))))))))) is different from true [2024-11-27 23:25:01,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:25:01,235 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 298 treesize of output 246 [2024-11-27 23:25:01,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse4 (select .cse9 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse1 (select .cse3 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse3 .cse4)) (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= .cse1 .cse5) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)))))) (and (= .cse4 4) (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_prenex_4) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_4) 4) 0) (= .cse6 .cse5) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse7 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse7 (select v_prenex_6 .cse7))) v_prenex_6) (= (select .cse8 4) 0) (= (select v_prenex_5 v_prenex_4) 1) (= (select v_prenex_6 .cse6) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse6) 8)) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select .cse8 0) 0)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse9 0) 0) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2024-11-27 23:25:01,508 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse4 (select .cse9 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse1 (select .cse3 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse3 .cse4)) (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= .cse1 .cse5) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)))))) (and (= .cse4 4) (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_prenex_4) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse6))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_4) 4) 0) (= .cse6 .cse5) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse7 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse7 (select v_prenex_6 .cse7))) v_prenex_6) (= (select .cse8 4) 0) (= (select v_prenex_5 v_prenex_4) 1) (= (select v_prenex_6 .cse6) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse6) 8)) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select .cse8 0) 0)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse9 0) 0) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2024-11-27 23:25:01,904 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2024-11-27 23:25:01,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 215 [2024-11-27 23:25:02,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:25:02,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 165 treesize of output 233 [2024-11-27 23:25:02,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:25:02,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2024-11-27 23:27:58,648 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse13 (select |v_#valid_BEFORE_CALL_8| .cse13))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))))) (.cse0 (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) (.cse1 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_#valid_BEFORE_CALL_8| .cse12))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0))))) (or (and .cse0 (or .cse1 (exists ((v_arrayElimCell_52 Int) (v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((v_arrayElimCell_52 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and .cse0 .cse1) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and (exists ((v_prenex_4 Int) (v_arrayElimIndex_18 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (and (= (select v_prenex_6 v_arrayElimIndex_18) 1) (= (select v_prenex_5 v_arrayElimIndex_18) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse6 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse6 (select v_prenex_6 .cse6))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1))) .cse0) (and .cse0 (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select v_prenex_5 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_6 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (let ((.cse7 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse7 (select v_prenex_6 .cse7))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1)))) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_8| .cse8))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))))))) (and .cse0 (or (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) .cse4)) (and .cse0 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0)))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse11 (select |v_#valid_BEFORE_CALL_8| .cse11))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17))))))))) is different from false [2024-11-27 23:27:58,658 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse13 (select |v_#valid_BEFORE_CALL_8| .cse13))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))))) (.cse0 (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) (.cse1 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_#valid_BEFORE_CALL_8| .cse12))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0))))) (or (and .cse0 (or .cse1 (exists ((v_arrayElimCell_52 Int) (v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((v_arrayElimCell_52 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and .cse0 .cse1) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and (exists ((v_prenex_4 Int) (v_arrayElimIndex_18 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (and (= (select v_prenex_6 v_arrayElimIndex_18) 1) (= (select v_prenex_5 v_arrayElimIndex_18) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse6 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse6 (select v_prenex_6 .cse6))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1))) .cse0) (and .cse0 (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select v_prenex_5 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_6 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (let ((.cse7 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse7 (select v_prenex_6 .cse7))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1)))) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_8| .cse8))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))))))) (and .cse0 (or (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) .cse4)) (and .cse0 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0)))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse11 (select |v_#valid_BEFORE_CALL_8| .cse11))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17))))))))) is different from true [2024-11-27 23:27:59,284 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 671 treesize of output 627 [2024-11-27 23:27:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-27 23:27:59,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:27:59,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_DerPreprocessor_1 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1538))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1543))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1548) (select (select (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1545))))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse5) .cse6)) (+ 8 (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse5) .cse6)))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2024-11-27 23:28:03,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse4 (+ .cse11 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1538))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1543))) .cse2 v_ArrVal_1548) (select (select (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1545))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse7) .cse8)) (+ (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse11))))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse7) .cse8) 8))))))) is different from false [2024-11-27 23:28:07,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse13 (select .cse14 .cse8)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse3 (select .cse7 .cse8)) (.cse5 (+ 4 .cse13)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| .cse2 v_ArrVal_1538))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1543))) .cse3 v_ArrVal_1548) (select (select (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse7 .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1545))))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) .cse9) .cse10)) (+ (select (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse14 .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse8) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse13))))) (store .cse11 .cse3 (store (select .cse11 .cse3) .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) .cse9) .cse10) 8)))))))) is different from false [2024-11-27 23:28:07,941 INFO L349 Elim1Store]: treesize reduction 857, result has 50.3 percent of original size [2024-11-27 23:28:07,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21158 treesize of output 20258 [2024-11-27 23:28:08,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:28:08,037 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 3519 treesize of output 3519 [2024-11-27 23:28:08,115 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 5436 treesize of output 4749 [2024-11-27 23:28:08,160 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 2350 treesize of output 1434 [2024-11-27 23:28:08,349 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 233 treesize of output 4 [2024-11-27 23:28:10,464 INFO L349 Elim1Store]: treesize reduction 99, result has 84.9 percent of original size [2024-11-27 23:28:10,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 12370 treesize of output 11454 [2024-11-27 23:28:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311513983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:11,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:28:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 44 [2024-11-27 23:28:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737276620] [2024-11-27 23:28:11,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:28:11,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-27 23:28:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:11,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-27 23:28:11,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=981, Unknown=33, NotChecked=1422, Total=2550 [2024-11-27 23:28:11,919 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 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 23:28:12,645 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2024-11-27 23:28:12,650 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2024-11-27 23:28:12,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2024-11-27 23:28:12,662 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2024-11-27 23:28:12,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 .cse1) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2024-11-27 23:28:12,674 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 .cse1) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2024-11-27 23:28:12,683 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-27 23:28:12,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from true [2024-11-27 23:28:12,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (select .cse4 0)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (select .cse0 4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) is different from false [2024-11-27 23:28:12,714 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (select .cse4 0)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (select .cse0 4)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) is different from true [2024-11-27 23:28:12,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (select .cse4 4)) .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (not (= .cse2 .cse3)) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |c_#valid| .cse6) 1))))) is different from false [2024-11-27 23:28:12,780 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse1 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (select .cse4 4)) .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (not (= .cse2 .cse3)) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select |c_#valid| .cse6) 1))))) is different from true [2024-11-27 23:28:12,825 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-27 23:28:12,830 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-27 23:28:12,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |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 (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-27 23:28:12,845 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |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 (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-27 23:28:12,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0))) (not (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse6 (select .cse7 4)) .cse1) (= (select .cse7 0) 0))) (and (exists ((v_arrayElimCell_43 Int)) (= .cse1 (select .cse6 v_arrayElimCell_43))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))))))) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from false [2024-11-27 23:28:12,870 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0))) (not (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse6 (select .cse7 4)) .cse1) (= (select .cse7 0) 0))) (and (exists ((v_arrayElimCell_43 Int)) (= .cse1 (select .cse6 v_arrayElimCell_43))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))))))) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from true [2024-11-27 23:28:12,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse3))) (and (= (select .cse5 (select .cse6 4)) .cse3) (= (select .cse6 0) 0))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3) (exists ((v_arrayElimCell_43 Int)) (= .cse3 (select .cse5 v_arrayElimCell_43)))))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8)))))) is different from false [2024-11-27 23:28:12,955 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse3))) (and (= (select .cse5 (select .cse6 4)) .cse3) (= (select .cse6 0) 0))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3) (exists ((v_arrayElimCell_43 Int)) (= .cse3 (select .cse5 v_arrayElimCell_43)))))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)))) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse8)))))) is different from true [2024-11-27 23:28:12,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse5 (select .cse8 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (and (= (select .cse7 (select .cse8 4)) .cse1) (= .cse5 0)) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (exists ((v_arrayElimCell_43 Int)) (= .cse1 (select .cse7 v_arrayElimCell_43)))))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))))) is different from false [2024-11-27 23:28:12,996 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse5 (select .cse8 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (and (= (select .cse7 (select .cse8 4)) .cse1) (= .cse5 0)) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (exists ((v_arrayElimCell_43 Int)) (= .cse1 (select .cse7 v_arrayElimCell_43)))))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))))) is different from true [2024-11-27 23:28:13,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse16 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (.cse6 (select .cse5 4))) (or (and (= .cse6 4) (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse9))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse8 0) 0) (= .cse9 .cse10) (= (select |v_#valid_BEFORE_CALL_8| .cse9) 0) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse11 (select |v_#valid_BEFORE_CALL_8| .cse11))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse8 4) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse9) 8)) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse9) 4))))))) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse7) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((v_arrayElimCell_52 Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse13 (select .cse14 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| .cse13))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse12 0) 0) (= .cse13 .cse10) (= (select |v_#valid_BEFORE_CALL_8| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse12 4) 0) (= .cse7 (select .cse14 .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse13) 8)) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse13) 4))))))) (= (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse15 (select |v_#valid_BEFORE_CALL_8| .cse15))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse7)))))))))))) is different from false [2024-11-27 23:28:13,136 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse16 0)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (.cse6 (select .cse5 4))) (or (and (= .cse6 4) (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse9))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse8 0) 0) (= .cse9 .cse10) (= (select |v_#valid_BEFORE_CALL_8| .cse9) 0) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse11 (select |v_#valid_BEFORE_CALL_8| .cse11))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse8 4) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse9) 8)) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse9) 4))))))) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse7) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((v_arrayElimCell_52 Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse13 (select .cse14 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| .cse13))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse12 0) 0) (= .cse13 .cse10) (= (select |v_#valid_BEFORE_CALL_8| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select .cse12 4) 0) (= .cse7 (select .cse14 .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse13) 8)) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse13) 4))))))) (= (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse15 (select |v_#valid_BEFORE_CALL_8| .cse15))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse7)))))))))))) is different from true [2024-11-27 23:28:13,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse5 (select .cse10 4)) (.cse6 (select .cse0 0))) (or (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse2 (select .cse4 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (= .cse2 .cse6) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)))))) (and (= .cse5 4) (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| v_prenex_4) 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_4) 4) 0) (= .cse7 .cse6) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse8 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse8 (select v_prenex_6 .cse8))) v_prenex_6) (= (select .cse9 4) 0) (= (select v_prenex_5 v_prenex_4) 1) (= (select v_prenex_6 .cse7) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse7) 8)) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select .cse9 0) 0)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse10 0) 0) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))))))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= 0 (select .cse10 |c_ULTIMATE.start_main_~ptr~0#1.offset|)))) is different from false [2024-11-27 23:28:13,426 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse5 (select .cse10 4)) (.cse6 (select .cse0 0))) (or (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_52))) (let ((.cse2 (select .cse4 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_52) 4) 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 .cse5)) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (= .cse2 .cse6) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)))))) (and (= .cse5 4) (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| v_prenex_4) 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_4) 4) 0) (= .cse7 .cse6) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse8 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse8 (select v_prenex_6 .cse8))) v_prenex_6) (= (select .cse9 4) 0) (= (select v_prenex_5 v_prenex_4) 1) (= (select v_prenex_6 .cse7) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse7) 8)) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select .cse9 0) 0)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse10 0) 0) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_36 Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_36) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))))))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= 0 (select .cse10 |c_ULTIMATE.start_main_~ptr~0#1.offset|)))) is different from true [2024-11-27 23:28:17,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse13 (select |v_#valid_BEFORE_CALL_8| .cse13))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))))) (.cse1 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_#valid_BEFORE_CALL_8| .cse12))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0))))) (or (and .cse0 (or .cse1 (exists ((v_arrayElimCell_52 Int) (v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((v_arrayElimCell_52 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and .cse0 .cse1) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and (exists ((v_prenex_4 Int) (v_arrayElimIndex_18 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (and (= (select v_prenex_6 v_arrayElimIndex_18) 1) (= (select v_prenex_5 v_arrayElimIndex_18) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse6 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse6 (select v_prenex_6 .cse6))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1))) .cse0) (and .cse0 (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select v_prenex_5 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_6 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (let ((.cse7 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse7 (select v_prenex_6 .cse7))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1)))) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_8| .cse8))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))))))) (and .cse0 (or (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) .cse4)) (and .cse0 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0)))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse11 (select |v_#valid_BEFORE_CALL_8| .cse11))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)))))))))) is different from false [2024-11-27 23:28:17,481 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse13 (select |v_#valid_BEFORE_CALL_8| .cse13))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))))) (.cse1 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_#valid_BEFORE_CALL_8| .cse12))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0))))) (or (and .cse0 (or .cse1 (exists ((v_arrayElimCell_52 Int) (v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((v_arrayElimCell_52 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and .cse0 .cse1) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))))) (and (exists ((v_prenex_4 Int) (v_arrayElimIndex_18 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (and (= (select v_prenex_6 v_arrayElimIndex_18) 1) (= (select v_prenex_5 v_arrayElimIndex_18) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse6 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse6 (select v_prenex_6 .cse6))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1))) .cse0) (and .cse0 (exists ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select v_prenex_5 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= (select v_prenex_6 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_6 |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (let ((.cse7 (@diff v_prenex_5 v_prenex_6))) (store v_prenex_5 .cse7 (select v_prenex_6 .cse7))) v_prenex_6) (= (select v_prenex_5 v_prenex_4) 1)))) (and .cse0 (or .cse4 (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_8| .cse8))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))))))) (and .cse0 (or (exists ((v_arrayElimCell_52 Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_52)) (exists ((v_arrayElimIndex_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= v_arrayElimIndex_17 v_arrayElimCell_52)))))) .cse4)) (and .cse0 (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0)))) (and .cse0 (or .cse1 (exists ((v_arrayElimIndex_17 Int)) (and (exists ((v_arrayElimCell_52 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse11 (select |v_#valid_BEFORE_CALL_8| .cse11))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_52) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_17)))))))))) is different from true [2024-11-27 23:28:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:17,652 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-11-27 23:28:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-27 23:28:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-27 23:28:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:17,654 INFO L225 Difference]: With dead ends: 89 [2024-11-27 23:28:17,654 INFO L226 Difference]: Without dead ends: 87 [2024-11-27 23:28:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=153, Invalid=1104, Unknown=61, NotChecked=3104, Total=4422 [2024-11-27 23:28:17,655 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1642 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:17,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 395 Invalid, 0 Unknown, 1642 Unchecked, 0.9s Time] [2024-11-27 23:28:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-27 23:28:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-27 23:28:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.12) internal successors, (84), 75 states have internal predecessors, (84), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-27 23:28:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-27 23:28:17,676 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 40 [2024-11-27 23:28:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:17,676 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-27 23:28:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 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 23:28:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-27 23:28:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:28:17,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:17,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:17,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 23:28:17,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-27 23:28:17,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1235718589, now seen corresponding path program 1 times [2024-11-27 23:28:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579493093] [2024-11-27 23:28:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 23:28:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579493093] [2024-11-27 23:28:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579493093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735991092] [2024-11-27 23:28:18,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:18,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:18,020 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:18,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:28:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:18,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 23:28:18,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 23:28:18,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:28:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 23:28:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735991092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:28:18,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:28:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-27 23:28:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308246438] [2024-11-27 23:28:18,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:28:18,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:28:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:18,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:28:18,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:28:18,395 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-27 23:28:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:18,469 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2024-11-27 23:28:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:28:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-11-27 23:28:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:18,470 INFO L225 Difference]: With dead ends: 143 [2024-11-27 23:28:18,470 INFO L226 Difference]: Without dead ends: 85 [2024-11-27 23:28:18,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:28:18,471 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:18,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:28:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-27 23:28:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-27 23:28:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-27 23:28:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-27 23:28:18,490 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 40 [2024-11-27 23:28:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:18,490 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-27 23:28:18,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-27 23:28:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-11-27 23:28:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 23:28:18,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:18,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:18,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 23:28:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-27 23:28:18,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1974063798, now seen corresponding path program 1 times [2024-11-27 23:28:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083124232] [2024-11-27 23:28:18,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083124232] [2024-11-27 23:28:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083124232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919348030] [2024-11-27 23:28:22,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:22,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:22,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:22,537 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:22,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:28:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:23,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 185 conjuncts are in the unsatisfiable core [2024-11-27 23:28:23,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:23,242 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 23:28:23,259 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 23:28:23,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:28:23,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-27 23:28:23,746 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:28:23,746 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 23:28:23,891 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 23:28:23,903 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 23:28:23,916 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 23:28:24,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 23:28:24,119 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 95 treesize of output 80 [2024-11-27 23:28:24,134 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 23:28:24,145 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 39 treesize of output 15 [2024-11-27 23:28:24,526 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-27 23:28:24,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 74 [2024-11-27 23:28:24,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-27 23:28:24,551 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 23:28:24,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2024-11-27 23:28:24,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 20 [2024-11-27 23:28:24,574 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 14 treesize of output 18 [2024-11-27 23:28:24,909 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 23:28:24,910 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 64 treesize of output 31 [2024-11-27 23:28:24,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2024-11-27 23:28:24,926 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 23:28:24,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 23:28:25,421 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 23:28:25,421 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 31 treesize of output 28 [2024-11-27 23:28:25,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:25,479 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 23:28:25,479 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 72 treesize of output 55 [2024-11-27 23:28:25,517 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:28:25,517 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 23:28:25,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 24 treesize of output 19 [2024-11-27 23:28:26,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:26,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:26,291 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 65 treesize of output 48 [2024-11-27 23:28:26,308 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67 [2024-11-27 23:28:26,340 INFO L349 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2024-11-27 23:28:26,341 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 2 case distinctions, treesize of input 179 treesize of output 87 [2024-11-27 23:28:26,391 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-27 23:28:26,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 233 treesize of output 126 [2024-11-27 23:28:26,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-27 23:28:26,407 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 42 treesize of output 23 [2024-11-27 23:28:26,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:26,435 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 85 treesize of output 43 [2024-11-27 23:28:26,708 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 142 treesize of output 94 [2024-11-27 23:28:27,388 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:28:27,388 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 88 treesize of output 43 [2024-11-27 23:28:27,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-27 23:28:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:27,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:28:28,046 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1961) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1960))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 (select v_ArrVal_1966 .cse1))) v_ArrVal_1966)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1964)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1972)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1966) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))))))))) is different from false [2024-11-27 23:28:28,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse14 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1961) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1960)) (.cse3 (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse1 (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (or (not (= (let ((.cse2 (+ .cse3 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1966 .cse2))) v_ArrVal_1966)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse11 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse7 (store (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse3))) .cse1 v_ArrVal_1964)) (.cse4 (store (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))) .cse1 v_ArrVal_1972)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (select (select .cse7 .cse8) .cse9))) (select (select (store .cse0 .cse1 v_ArrVal_1966) (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 8)))))))))) is different from false [2024-11-27 23:28:28,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse12)) (.cse16 (select |c_#memory_$Pointer$#1.offset| .cse12)) (.cse14 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#1| .cse12 v_ArrVal_1961) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1960)) (.cse3 (select .cse16 .cse14)) (.cse1 (select .cse13 .cse14))) (or (not (= v_ArrVal_1966 (let ((.cse2 (+ 4 .cse3))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1966 .cse2))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse11 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4))) (let ((.cse7 (store (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| .cse12 (store .cse16 .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse11 .cse14) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse3))) .cse1 v_ArrVal_1964)) (.cse4 (store (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 (store .cse13 .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse11 .cse12) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse1))) .cse1 v_ArrVal_1972)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (select (select .cse7 .cse8) .cse9))) (select (select (store .cse0 .cse1 v_ArrVal_1966) (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 8))))))))))) is different from false [2024-11-27 23:28:28,392 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| Int) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1983)) (.cse14 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1982)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse16 (select .cse14 .cse8)) (.cse11 (select .cse10 .cse8)) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#1| .cse8 v_ArrVal_1961) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| v_ArrVal_1960)) (.cse1 (select .cse11 .cse12)) (.cse15 (select .cse16 .cse12))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (let ((.cse13 (store .cse16 .cse12 0))) (store (store |c_#memory_$Pointer$#1.offset| .cse8 .cse13) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| (store (store (select (store .cse14 .cse8 .cse13) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|) 4 .cse12) 0 .cse15))) .cse1 v_ArrVal_1964)) (.cse2 (store (let ((.cse9 (store .cse11 .cse12 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|))) (store (store |c_#memory_$Pointer$#1.base| .cse8 .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32| (store (store (select (store .cse10 .cse8 .cse9) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|) 4 .cse8) 0 .cse1))) .cse1 v_ArrVal_1972)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 .cse1 v_ArrVal_1966) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))))) (not (= v_ArrVal_1966 (let ((.cse17 (+ .cse15 4))) (store (select .cse0 .cse1) .cse17 (select v_ArrVal_1966 .cse17))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_32|) 0))))))) is different from false [2024-11-27 23:28:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919348030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:28,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:28:28,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2024-11-27 23:28:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575674182] [2024-11-27 23:28:28,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:28:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-27 23:28:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:28,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-27 23:28:28,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2516, Unknown=4, NotChecked=412, Total=3080 [2024-11-27 23:28:28,401 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 48 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 39 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 23:28:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:32,557 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-27 23:28:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-27 23:28:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 39 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 42 [2024-11-27 23:28:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:32,559 INFO L225 Difference]: With dead ends: 95 [2024-11-27 23:28:32,559 INFO L226 Difference]: Without dead ends: 93 [2024-11-27 23:28:32,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=278, Invalid=4564, Unknown=4, NotChecked=556, Total=5402 [2024-11-27 23:28:32,561 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:32,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 447 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-27 23:28:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-27 23:28:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2024-11-27 23:28:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 75 states have internal predecessors, (82), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-27 23:28:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-27 23:28:32,592 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 42 [2024-11-27 23:28:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:32,593 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-27 23:28:32,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 39 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 23:28:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-27 23:28:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 23:28:32,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:32,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:32,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-27 23:28:32,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:32,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1300202835, now seen corresponding path program 1 times [2024-11-27 23:28:32,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:32,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137633224] [2024-11-27 23:28:32,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:32,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:28:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137633224] [2024-11-27 23:28:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137633224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493765507] [2024-11-27 23:28:33,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:33,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:33,084 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:33,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 23:28:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 23:28:33,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:28:33,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:28:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493765507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:33,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:28:33,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-11-27 23:28:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004878639] [2024-11-27 23:28:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:33,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:28:33,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:33,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:28:33,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:28:33,558 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 23:28:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:33,661 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2024-11-27 23:28:33,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:28:33,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-27 23:28:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:33,663 INFO L225 Difference]: With dead ends: 105 [2024-11-27 23:28:33,663 INFO L226 Difference]: Without dead ends: 102 [2024-11-27 23:28:33,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:28:33,664 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:33,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 175 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:28:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-27 23:28:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2024-11-27 23:28:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 78 states have internal predecessors, (86), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-27 23:28:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-11-27 23:28:33,689 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 44 [2024-11-27 23:28:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:33,690 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-11-27 23:28:33,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-27 23:28:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-11-27 23:28:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-27 23:28:33,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:33,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:33,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 23:28:33,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-27 23:28:33,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:33,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1651659222, now seen corresponding path program 1 times [2024-11-27 23:28:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:33,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029166928] [2024-11-27 23:28:33,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:38,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:38,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029166928] [2024-11-27 23:28:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029166928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:38,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33951530] [2024-11-27 23:28:38,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:38,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:38,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:38,003 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:38,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 23:28:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:38,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 199 conjuncts are in the unsatisfiable core [2024-11-27 23:28:38,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:38,767 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 23:28:38,854 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 23:28:39,504 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:28:39,504 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 23:28:39,519 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 23:28:39,659 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 23:28:39,668 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 23:28:39,680 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 23:28:39,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 23:28:39,855 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 95 treesize of output 80 [2024-11-27 23:28:39,867 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 39 treesize of output 15 [2024-11-27 23:28:39,883 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 23:28:40,222 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-27 23:28:40,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 88 [2024-11-27 23:28:40,235 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 51 treesize of output 29 [2024-11-27 23:28:40,254 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 23:28:40,259 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 23:28:40,632 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 23:28:40,632 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 79 treesize of output 38 [2024-11-27 23:28:40,639 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 23:28:40,646 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 30 treesize of output 10 [2024-11-27 23:28:40,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 23:28:41,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:41,198 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 23:28:41,198 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 87 treesize of output 64 [2024-11-27 23:28:41,264 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-27 23:28:41,264 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 46 treesize of output 58 [2024-11-27 23:28:41,335 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-27 23:28:41,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-27 23:28:41,378 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:28:41,379 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 23:28:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:42,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:42,414 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 77 treesize of output 60 [2024-11-27 23:28:42,513 INFO L349 Elim1Store]: treesize reduction 106, result has 24.3 percent of original size [2024-11-27 23:28:42,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 5 case distinctions, treesize of input 529 treesize of output 229 [2024-11-27 23:28:42,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 84 [2024-11-27 23:28:42,540 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 23:28:43,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:43,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2024-11-27 23:28:44,454 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 149 treesize of output 105 [2024-11-27 23:28:44,519 INFO L349 Elim1Store]: treesize reduction 114, result has 11.6 percent of original size [2024-11-27 23:28:44,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 151 treesize of output 89 [2024-11-27 23:28:44,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2024-11-27 23:28:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:44,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:28:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33951530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:55,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:28:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 52 [2024-11-27 23:28:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007362373] [2024-11-27 23:28:55,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:28:55,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-27 23:28:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:55,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-27 23:28:55,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3343, Unknown=5, NotChecked=0, Total=3540 [2024-11-27 23:28:55,040 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 52 states, 49 states have (on average 1.510204081632653) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:29:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:00,582 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-11-27 23:29:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-27 23:29:00,585 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.510204081632653) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2024-11-27 23:29:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:00,586 INFO L225 Difference]: With dead ends: 97 [2024-11-27 23:29:00,586 INFO L226 Difference]: Without dead ends: 69 [2024-11-27 23:29:00,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=298, Invalid=5099, Unknown=5, NotChecked=0, Total=5402 [2024-11-27 23:29:00,589 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:29:00,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 517 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-27 23:29:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-27 23:29:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-27 23:29:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:29:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-27 23:29:00,603 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 45 [2024-11-27 23:29:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:00,604 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-27 23:29:00,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.510204081632653) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:29:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-27 23:29:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 23:29:00,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:00,606 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1] [2024-11-27 23:29:00,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-27 23:29:00,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 23:29:00,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:00,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 840980876, now seen corresponding path program 2 times [2024-11-27 23:29:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:29:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101252885] [2024-11-27 23:29:00,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:29:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:29:00,869 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:29:00,869 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:29:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-27 23:29:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:29:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101252885] [2024-11-27 23:29:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101252885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:29:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752344794] [2024-11-27 23:29:00,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:29:00,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:00,973 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:00,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 23:29:01,448 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:29:01,448 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:29:01,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 23:29:01,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-27 23:29:01,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:29:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752344794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:29:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:29:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-27 23:29:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403503464] [2024-11-27 23:29:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:29:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:29:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:29:01,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:29:01,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:29:01,491 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:29:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:01,513 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-27 23:29:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:29:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-11-27 23:29:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:01,514 INFO L225 Difference]: With dead ends: 74 [2024-11-27 23:29:01,514 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 23:29:01,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:29:01,515 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 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 23:29:01,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:29:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 23:29:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 23:29:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:29:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 23:29:01,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-27 23:29:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:01,520 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 23:29:01,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:29:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 23:29:01,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 23:29:01,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:29:01,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-27 23:29:01,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-27 23:29:01,734 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:29:01,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 23:29:06,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:29:06,404 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:580) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:166) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:483) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:144) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:402) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContext(BacktranslationService.java:117) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-27 23:29:06,409 INFO L158 Benchmark]: Toolchain (without parser) took 308245.81ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 100.3MB in the beginning and 164.5MB in the end (delta: -64.2MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. [2024-11-27 23:29:06,410 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 167.8MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:29:06,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.58ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 81.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:29:06,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.92ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:29:06,410 INFO L158 Benchmark]: Boogie Preprocessor took 101.82ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 76.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:29:06,411 INFO L158 Benchmark]: RCFGBuilder took 775.08ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 55.6MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:29:06,411 INFO L158 Benchmark]: TraceAbstraction took 306813.21ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 54.9MB in the beginning and 164.5MB in the end (delta: -109.5MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. [2024-11-27 23:29:06,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 167.8MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.58ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 81.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.92ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 101.82ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 76.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 775.08ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 55.6MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 306813.21ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 54.9MB in the beginning and 164.5MB in the end (delta: -109.5MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 672]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 302.1s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 32.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 3651 SdHoareTripleChecker+Invalid, 31.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1642 IncrementalHoareTripleChecker+Unchecked, 3132 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4167 IncrementalHoareTripleChecker+Invalid, 5910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 519 mSDtfsCounter, 4167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 908 GetRequests, 551 SyntacticMatches, 2 SemanticMatches, 355 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 3893 ImplicationChecksByTransitivity, 60.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=13, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 68 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 249.0s InterpolantComputationTime, 1032 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1160 ConstructedInterpolants, 74 QuantifiedInterpolants, 18007 SizeOfPredicates, 67 NumberOfNonLiveVariables, 4723 ConjunctsInSsa, 768 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 404/542 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:580) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-27 23:29:06,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/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_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:29:09,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:29:09,514 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 23:29:09,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:29:09,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:29:09,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:29:09,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:29:09,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:29:09,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:29:09,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:29:09,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:29:09,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:29:09,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:29:09,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:29:09,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:29:09,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:29:09,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:29:09,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:29:09,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:29:09,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:29:09,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:29:09,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:29:09,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:29:09,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:29:09,609 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 23:29:09,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 23:29:09,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:29:09,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:29:09,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:29:09,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:29:09,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:29:09,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:29:09,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:29:09,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:29:09,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:29:09,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:29:09,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:29:09,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:29:09,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:29:09,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:29:09,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:29:09,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:29:09,613 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_54f19277-6d97-4361-ace0-33abb2f8f34e/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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-27 23:29:09,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:29:09,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:29:09,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:29:09,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:29:09,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:29:10,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-27 23:29:13,187 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/8915e3962/87959e94814f4bf2bb18fa05e20c1194/FLAGe4e15967d [2024-11-27 23:29:13,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:29:13,578 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-27 23:29:13,599 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/8915e3962/87959e94814f4bf2bb18fa05e20c1194/FLAGe4e15967d [2024-11-27 23:29:13,772 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/data/8915e3962/87959e94814f4bf2bb18fa05e20c1194 [2024-11-27 23:29:13,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:29:13,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:29:13,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:29:13,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:29:13,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:29:13,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:29:13" (1/1) ... [2024-11-27 23:29:13,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307b2167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:13, skipping insertion in model container [2024-11-27 23:29:13,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:29:13" (1/1) ... [2024-11-27 23:29:13,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:29:14,258 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_54f19277-6d97-4361-ace0-33abb2f8f34e/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-27 23:29:14,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:29:14,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:29:14,333 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_54f19277-6d97-4361-ace0-33abb2f8f34e/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-27 23:29:14,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:29:14,369 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:29:14,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14 WrapperNode [2024-11-27 23:29:14,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:29:14,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:29:14,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:29:14,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:29:14,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,439 INFO L138 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 183 [2024-11-27 23:29:14,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:29:14,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:29:14,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:29:14,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:29:14,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,478 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-27 23:29:14,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:29:14,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:29:14,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:29:14,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:29:14,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (1/1) ... [2024-11-27 23:29:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:29:14,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:14,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:29:14,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:29:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 23:29:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 23:29:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 23:29:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 23:29:14,598 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 23:29:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:29:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:29:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:29:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:29:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:29:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:29:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:29:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:29:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:29:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 23:29:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 23:29:14,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 23:29:14,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:29:14,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:29:14,768 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:29:14,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:29:15,571 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-27 23:29:15,572 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:29:15,582 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:29:15,582 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 23:29:15,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:29:15 BoogieIcfgContainer [2024-11-27 23:29:15,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:29:15,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:29:15,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:29:15,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:29:15,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:29:13" (1/3) ... [2024-11-27 23:29:15,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6186fcdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:29:15, skipping insertion in model container [2024-11-27 23:29:15,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:29:14" (2/3) ... [2024-11-27 23:29:15,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6186fcdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:29:15, skipping insertion in model container [2024-11-27 23:29:15,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:29:15" (3/3) ... [2024-11-27 23:29:15,594 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-27 23:29:15,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:29:15,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 44 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 23:29:15,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:29:15,701 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;@3b941e0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:29:15,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:29:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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 23:29:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 23:29:15,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:15,723 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] [2024-11-27 23:29:15,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:15,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1272870556, now seen corresponding path program 1 times [2024-11-27 23:29:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:15,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428624889] [2024-11-27 23:29:15,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:15,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:15,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:15,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:29:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:15,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 23:29:16,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:29:16,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:29:16,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428624889] [2024-11-27 23:29:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428624889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:29:16,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:29:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:29:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338764420] [2024-11-27 23:29:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:29:16,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:29:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:16,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:29:16,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:29:16,058 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 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 23:29:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:16,079 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-27 23:29:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:29:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 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 25 [2024-11-27 23:29:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:16,089 INFO L225 Difference]: With dead ends: 79 [2024-11-27 23:29:16,089 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 23:29:16,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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 23:29:16,095 INFO L435 NwaCegarLoop]: 58 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, 58 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 23:29:16,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:29:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 23:29:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-27 23:29:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 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 23:29:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-27 23:29:16,138 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-27 23:29:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:16,140 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-27 23:29:16,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 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 23:29:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-27 23:29:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 23:29:16,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:16,144 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] [2024-11-27 23:29:16,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:29:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:16,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1190653912, now seen corresponding path program 1 times [2024-11-27 23:29:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536199654] [2024-11-27 23:29:16,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:16,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:16,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:29:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:16,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 23:29:16,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:29:16,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:29:16,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536199654] [2024-11-27 23:29:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536199654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:29:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:29:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:29:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598796224] [2024-11-27 23:29:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:29:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:29:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:16,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:29:16,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:29:16,648 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:29:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:16,813 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-11-27 23:29:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:29:16,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-27 23:29:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:16,815 INFO L225 Difference]: With dead ends: 50 [2024-11-27 23:29:16,816 INFO L226 Difference]: Without dead ends: 38 [2024-11-27 23:29:16,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 23:29:16,817 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 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.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:29:16,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:29:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-27 23:29:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-27 23:29:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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 23:29:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-11-27 23:29:16,865 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 25 [2024-11-27 23:29:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:16,866 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-11-27 23:29:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:29:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-11-27 23:29:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-27 23:29:16,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:16,868 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 23:29:16,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:29:17,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:17,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:17,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1759073900, now seen corresponding path program 1 times [2024-11-27 23:29:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505217156] [2024-11-27 23:29:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:17,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:17,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:17,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:17,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:29:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:17,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 23:29:17,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:29:17,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:29:17,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505217156] [2024-11-27 23:29:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505217156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:29:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:29:17,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:29:17,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191461753] [2024-11-27 23:29:17,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:29:17,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:29:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:17,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:29:17,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:29:17,326 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 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 23:29:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:17,362 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2024-11-27 23:29:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:29:17,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 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 27 [2024-11-27 23:29:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:17,365 INFO L225 Difference]: With dead ends: 70 [2024-11-27 23:29:17,366 INFO L226 Difference]: Without dead ends: 42 [2024-11-27 23:29:17,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 23:29:17,367 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 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 23:29:17,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:29:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-27 23:29:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-27 23:29:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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 23:29:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-27 23:29:17,381 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 27 [2024-11-27 23:29:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:17,382 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-27 23:29:17,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 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 23:29:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-27 23:29:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:29:17,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:17,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:29:17,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 23:29:17,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:17,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:17,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash -169874309, now seen corresponding path program 1 times [2024-11-27 23:29:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:17,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571042396] [2024-11-27 23:29:17,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:17,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:17,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:17,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:29:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:17,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-27 23:29:17,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:17,881 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 7 [2024-11-27 23:29:18,265 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 23:29:18,495 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 23:29:18,495 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 19 treesize of output 27 [2024-11-27 23:29:18,666 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 23:29:18,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 23:29:18,884 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 23:29:18,919 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 23:29:19,324 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2024-11-27 23:29:19,324 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 112 treesize of output 43 [2024-11-27 23:29:19,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:29:19,352 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 30 treesize of output 27 [2024-11-27 23:29:19,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-27 23:29:19,688 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 32 treesize of output 16 [2024-11-27 23:29:19,705 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 19 treesize of output 11 [2024-11-27 23:29:20,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:29:20,210 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 29 [2024-11-27 23:29:20,261 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-27 23:29:20,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-27 23:29:20,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 23:29:20,877 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 23:29:21,201 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-27 23:29:21,215 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 23:29:21,364 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 23:29:21,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 23:29:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:29:21,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:29:22,952 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| (_ BitVec 32))) (or (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_331) .cse0) .cse1 v_ArrVal_323)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_322) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_330) .cse0) .cse1) v_ArrVal_319)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10|))))) is different from false [2024-11-27 23:29:22,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:22,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571042396] [2024-11-27 23:29:22,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571042396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:29:22,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1422329604] [2024-11-27 23:29:22,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 23:29:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 23:29:22,962 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 23:29:22,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-27 23:29:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:23,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-27 23:29:23,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:23,698 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 7 [2024-11-27 23:29:24,107 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 23:29:24,227 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 23:29:24,227 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 19 treesize of output 27 [2024-11-27 23:29:24,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 23:29:24,483 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 23:29:24,723 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 23:29:24,750 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 23:29:25,300 INFO L349 Elim1Store]: treesize reduction 54, result has 8.5 percent of original size [2024-11-27 23:29:25,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 86 [2024-11-27 23:29:25,327 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-11-27 23:29:25,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 66 [2024-11-27 23:29:25,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:29:25,343 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 28 treesize of output 25 [2024-11-27 23:29:25,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-27 23:29:25,366 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 28 treesize of output 19 [2024-11-27 23:29:25,751 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 32 treesize of output 16 [2024-11-27 23:29:25,762 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 19 treesize of output 11 [2024-11-27 23:29:25,776 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 23:29:30,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:29:30,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 40 treesize of output 29 [2024-11-27 23:29:30,356 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-27 23:29:30,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-27 23:29:30,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 23:29:30,994 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 23:29:31,330 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 64 treesize of output 26 [2024-11-27 23:29:31,337 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 23:29:31,505 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 23:29:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:29:31,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:29:31,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_450) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (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_449 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_449 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-27 23:29:31,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_449) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_451) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_450) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_449 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_449 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2024-11-27 23:29:32,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32)) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_449) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_451) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_458) .cse0) .cse1) v_ArrVal_450) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_459) .cse0) .cse1 (select v_ArrVal_449 .cse1)) v_ArrVal_449))))) is different from false [2024-11-27 23:29:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1422329604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:29:32,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:29:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2024-11-27 23:29:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064803917] [2024-11-27 23:29:32,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:29:32,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-27 23:29:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:32,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-27 23:29:32,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2144, Unknown=57, NotChecked=388, Total=2756 [2024-11-27 23:29:32,375 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 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 23:29:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:55,768 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2024-11-27 23:29:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-27 23:29:55,769 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 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 37 [2024-11-27 23:29:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:55,771 INFO L225 Difference]: With dead ends: 82 [2024-11-27 23:29:55,773 INFO L226 Difference]: Without dead ends: 80 [2024-11-27 23:29:55,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=266, Invalid=3351, Unknown=59, NotChecked=484, Total=4160 [2024-11-27 23:29:55,777 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 70 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:29:55,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 591 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 21.9s Time] [2024-11-27 23:29:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-27 23:29:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2024-11-27 23:29:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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 23:29:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-27 23:29:55,800 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 37 [2024-11-27 23:29:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:55,801 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-27 23:29:55,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 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 23:29:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-27 23:29:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:29:55,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:55,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:29:55,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 23:29:56,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-27 23:29:56,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 23:29:56,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2088635427, now seen corresponding path program 1 times [2024-11-27 23:29:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335301097] [2024-11-27 23:29:56,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:56,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:56,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:56,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:56,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:29:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:56,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 23:29:56,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:29:56,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:29:56,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335301097] [2024-11-27 23:29:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335301097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:29:56,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:29:56,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:29:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488296121] [2024-11-27 23:29:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:29:56,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:29:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:56,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:29:56,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:29:56,451 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:29:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:56,499 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2024-11-27 23:29:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:29:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-27 23:29:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:56,500 INFO L225 Difference]: With dead ends: 76 [2024-11-27 23:29:56,500 INFO L226 Difference]: Without dead ends: 61 [2024-11-27 23:29:56,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:29:56,501 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:29:56,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:29:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-27 23:29:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2024-11-27 23:29:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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 23:29:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-27 23:29:56,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 37 [2024-11-27 23:29:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:56,514 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-27 23:29:56,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:29:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-27 23:29:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:29:56,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:56,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:29:56,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 23:29:56,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:56,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -819238401, now seen corresponding path program 2 times [2024-11-27 23:29:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139530896] [2024-11-27 23:29:56,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:29:56,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:56,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:56,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:29:57,117 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:29:57,117 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:29:57,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 23:29:57,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:29:57,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:29:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:29:57,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139530896] [2024-11-27 23:29:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139530896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:29:57,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:29:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-27 23:29:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560198062] [2024-11-27 23:29:57,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:29:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:29:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:29:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:29:57,424 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 23:29:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:57,509 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-27 23:29:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:29:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2024-11-27 23:29:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:57,511 INFO L225 Difference]: With dead ends: 77 [2024-11-27 23:29:57,511 INFO L226 Difference]: Without dead ends: 60 [2024-11-27 23:29:57,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:29:57,512 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:29:57,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 174 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:29:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-27 23:29:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-27 23:29:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 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 23:29:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-27 23:29:57,526 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 39 [2024-11-27 23:29:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-27 23:29:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 23:29:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-27 23:29:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:29:57,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:57,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:29:57,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 23:29:57,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:57,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1556967777, now seen corresponding path program 1 times [2024-11-27 23:29:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:29:57,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320219784] [2024-11-27 23:29:57,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:57,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:29:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:29:57,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:29:57,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:29:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:57,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 23:29:57,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:29:58,165 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 23:29:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:29:58,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:29:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 23:29:58,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:29:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320219784] [2024-11-27 23:29:58,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320219784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:29:58,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:29:58,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2024-11-27 23:29:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171912453] [2024-11-27 23:29:58,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:29:58,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:29:58,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:29:58,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:29:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:29:58,344 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:30:02,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:09,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:09,948 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2024-11-27 23:30:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:30:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-27 23:30:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:09,950 INFO L225 Difference]: With dead ends: 93 [2024-11-27 23:30:09,950 INFO L226 Difference]: Without dead ends: 61 [2024-11-27 23:30:09,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:30:09,951 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:09,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 309 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2024-11-27 23:30:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-27 23:30:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-27 23:30:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 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 23:30:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-27 23:30:09,966 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 39 [2024-11-27 23:30:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-27 23:30:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:30:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-27 23:30:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:30:09,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:09,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:09,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 23:30:10,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:10,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:10,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1253884835, now seen corresponding path program 1 times [2024-11-27 23:30:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:30:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573059630] [2024-11-27 23:30:10,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:10,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:10,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 23:30:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:10,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 23:30:10,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:30:10,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:30:10,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:30:10,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573059630] [2024-11-27 23:30:10,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573059630] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:10,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:30:10,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-11-27 23:30:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966776587] [2024-11-27 23:30:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:10,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:30:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:30:10,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:30:10,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:30:10,875 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:30:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:11,118 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-27 23:30:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:30:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-27 23:30:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:11,120 INFO L225 Difference]: With dead ends: 76 [2024-11-27 23:30:11,120 INFO L226 Difference]: Without dead ends: 65 [2024-11-27 23:30:11,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-27 23:30:11,121 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:11,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:30:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-27 23:30:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-11-27 23:30:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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 23:30:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-27 23:30:11,136 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 40 [2024-11-27 23:30:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:11,136 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-27 23:30:11,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:30:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-27 23:30:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:30:11,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:11,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:11,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:11,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:11,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1253810373, now seen corresponding path program 1 times [2024-11-27 23:30:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:30:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373453108] [2024-11-27 23:30:11,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:11,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:11,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:11,341 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:11,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f19277-6d97-4361-ace0-33abb2f8f34e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 23:30:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:11,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-27 23:30:11,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:11,574 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 7 [2024-11-27 23:30:11,876 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 23:30:11,876 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 19 treesize of output 27 [2024-11-27 23:30:11,970 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 23:30:12,057 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 23:30:12,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:12,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2024-11-27 23:30:12,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-27 23:30:12,558 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 19 treesize of output 11 [2024-11-27 23:30:12,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 11 treesize of output 3 [2024-11-27 23:30:12,780 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 23:30:13,023 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-27 23:30:13,023 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 24 treesize of output 26 [2024-11-27 23:30:13,041 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 23:30:13,837 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2024-11-27 23:30:13,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:13,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:16,156 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-27 23:30:16,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 216 [2024-11-27 23:30:16,208 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 145 treesize of output 45 [2024-11-27 23:30:16,885 INFO L349 Elim1Store]: treesize reduction 173, result has 18.8 percent of original size [2024-11-27 23:30:16,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 263 treesize of output 220 [2024-11-27 23:30:17,147 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-11-27 23:30:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 62 [2024-11-27 23:30:17,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2024-11-27 23:30:17,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-27 23:30:17,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-27 23:30:17,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:30:17,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-27 23:30:17,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 60 [2024-11-27 23:30:17,821 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 105 treesize of output 80 [2024-11-27 23:30:17,844 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 81 treesize of output 58 [2024-11-27 23:30:17,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:17,954 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 37 treesize of output 34 [2024-11-27 23:30:17,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-27 23:30:18,060 INFO L349 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2024-11-27 23:30:18,060 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 163 treesize of output 120 [2024-11-27 23:30:18,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-27 23:30:18,136 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 86 treesize of output 30 [2024-11-27 23:30:18,159 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 28 treesize of output 1 [2024-11-27 23:30:18,339 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 65 treesize of output 41 [2024-11-27 23:30:18,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-27 23:30:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 23:30:18,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 23:30:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:18,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:19,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:19,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 174 [2024-11-27 23:30:20,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:20,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1306 treesize of output 1320 [2024-11-27 23:30:20,645 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 1590 treesize of output 1566 [2024-11-27 23:30:20,806 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 6 treesize of output 4 [2024-11-27 23:30:23,018 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 6 treesize of output 4 [2024-11-27 23:30:23,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:23,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1886 treesize of output 1872 [2024-11-27 23:31:13,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse115 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse11 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv4 32)))) (let ((.cse116 (store (store (select .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse20 (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse116)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse23 (= .cse7 .cse6)) (.cse5 (select .cse20 .cse9))) (let ((.cse0 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (let ((.cse166 (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse167 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse167 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse166 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse166 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse165 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse164 v_ArrVal_969) .cse165))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse164 v_arrayElimCell_86) .cse165)))))) (.cse1 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse162 (let ((.cse163 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse163 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse163 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse162 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse162 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))))))) (.cse14 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (let ((.cse160 (let ((.cse161 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse161 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse161 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse160 .cse9 (store (select .cse160 .cse9) .cse6 v_ArrVal_972)))) (.cse159 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse158 v_arrayElimCell_86) .cse159))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse158 v_ArrVal_969) .cse159)))))) (.cse13 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse156 (let ((.cse157 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse157 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse157 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse156 .cse9 (store (select .cse156 .cse9) .cse6 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))))) (.cse51 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select (let ((.cse154 (let ((.cse155 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse155 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse155 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse154 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse154 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse12 (not .cse23)) (.cse2 (not .cse37))) (let ((.cse16 (and (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (let ((.cse111 (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse112 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse112 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse111 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse111 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse110 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse109 v_arrayElimCell_86) .cse110)) (= (select (select .cse109 v_arrayElimCell_90) .cse110) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (let ((.cse117 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse117 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse117 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse114 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse113 v_arrayElimCell_90) .cse114))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse113 v_arrayElimCell_86) .cse114)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse113 v_ArrVal_969) .cse114))))) (or (and (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse118 (let ((.cse119 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse119 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse119 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse118 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse118 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))))) .cse0 .cse1) .cse2) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (let ((.cse122 (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse123 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse123 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse122 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse122 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse121 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse120 v_ArrVal_969) .cse121))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse120 v_arrayElimCell_86) .cse121)) (= (select (select .cse120 v_arrayElimCell_90) .cse121) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse37 .cse12 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (let ((.cse126 (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse127 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse127 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse126 .cse9 (store (select .cse126 .cse9) .cse6 v_ArrVal_972)))) (.cse125 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse124 v_arrayElimCell_90) .cse125) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_ArrVal_969) .cse125)))))) (or .cse12 (and .cse14 (or .cse37 .cse13))) (or .cse37 (and (or .cse51 .cse23) (or .cse12 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (let ((.cse130 (let ((.cse131 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse131 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse131 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse130 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse130 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse129 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse128 v_ArrVal_969) .cse129)) (= (select (select .cse128 v_arrayElimCell_90) .cse129) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (let ((.cse134 (let ((.cse135 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse135 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse135 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse134 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse134 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse133 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse132 v_ArrVal_969) .cse133))) (= (select (select .cse132 v_arrayElimCell_90) .cse133) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select (let ((.cse136 (let ((.cse137 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse137 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse137 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse136 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse136 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)) (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (or (and (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (let ((.cse140 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse140 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse140 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse139 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse138 v_arrayElimCell_90) .cse139))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse138 v_ArrVal_969) .cse139))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse141 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse141 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse141 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse2)) .cse12) (or .cse37 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse142 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse142 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse142 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (let ((.cse145 (let ((.cse146 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse146 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse146 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse145 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse145 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse144 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse143 v_arrayElimCell_90) .cse144) |c_ULTIMATE.start_main_~uneq~0#1|)) (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse143 v_arrayElimCell_86) .cse144)))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse149 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse149 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse148 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse147 v_arrayElimCell_86) .cse148)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse147 v_ArrVal_969) .cse148))))) .cse2) (or .cse23 (and (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (let ((.cse152 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse152 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse152 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse151 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse150 v_arrayElimCell_90) .cse151))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse150 v_arrayElimCell_86) .cse151))))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse153 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse153 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse153 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse2))))) (.cse15 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (.cse56 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (let ((.cse107 (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse108 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse108 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse107 .cse9 (store (select .cse107 .cse9) .cse6 v_ArrVal_972)))) (.cse106 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse106)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 v_arrayElimCell_86) .cse106)))))) (.cse46 (and (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (let ((.cse87 (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse88 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse88 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse87 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse86 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse85 v_arrayElimCell_86) .cse86)) (= (select (select .cse85 v_arrayElimCell_90) .cse86) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (let ((.cse91 (let ((.cse92 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse92 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse92 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse91 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse91 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse90 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse89 v_ArrVal_969) .cse90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse89 v_arrayElimCell_86) .cse90)) (= (select (select .cse89 v_arrayElimCell_90) .cse90) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (let ((.cse95 (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse96 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse96 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse95 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse95 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse94 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse93 v_arrayElimCell_86) .cse94)) (= (select (select .cse93 v_arrayElimCell_90) .cse94) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) .cse23) (or .cse37 (and (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (let ((.cse99 (let ((.cse100 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse100 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse100 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse99 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse99 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse98 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse97 v_ArrVal_969) .cse98))) (= (select (select .cse97 v_arrayElimCell_90) .cse98) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse101 (let ((.cse102 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse102 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse102 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse101 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse101 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse103 (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse104 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse104 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse103 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse103 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))))))) (.cse17 (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (.cse36 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (let ((.cse83 (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse84 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse84 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse83 .cse9 (store (select .cse83 .cse9) .cse6 v_ArrVal_972)))) (.cse82 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse81 v_arrayElimCell_86) .cse82)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse81 v_ArrVal_969) .cse82))))))) (and (or (and .cse0 .cse1) .cse2) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse8 (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse6 v_ArrVal_972)))) (.cse4 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 v_arrayElimCell_86) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 v_ArrVal_969) .cse4))))) (or .cse12 .cse13) (or .cse14 .cse2) (or .cse15 .cse16) (or .cse17 .cse16) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (let ((.cse21 (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse21 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse19 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_ArrVal_969) .cse19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_86) .cse19)) (= (select (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse19) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (let ((.cse26 (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse26 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse25 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_86) .cse25)) (= (select (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse25) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (let ((.cse30 (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse30 .cse9 (store (select .cse30 .cse9) .cse6 v_ArrVal_972)))) (.cse29 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse29)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_86) .cse29))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_ArrVal_969) .cse29))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (let ((.cse34 (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse34 .cse9 (store (select .cse34 .cse9) .cse6 v_ArrVal_972)))) (.cse33 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 v_ArrVal_969) .cse33))))) .cse12) (or .cse36 .cse2) (or .cse36 .cse12) (or (and (or .cse37 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select (let ((.cse38 (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse39 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse39 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse38 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (let ((.cse42 (let ((.cse43 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse43 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse42 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse41 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse40 v_arrayElimCell_90) .cse41) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 v_arrayElimCell_86) .cse41)))))))) .cse17) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse44 (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse45 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse45 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse44 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse2) (or .cse15 .cse46) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (let ((.cse49 (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse50 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse50 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse49 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse48 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse47 v_arrayElimCell_86) .cse48)) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse48) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse17 (and (or .cse51 .cse37) (or .cse1 .cse2) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse54 (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse55 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse55 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse54 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse53 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse52 v_arrayElimCell_90) .cse53) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_86) .cse53))))))))) (or .cse23 (and .cse56 (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse57 (let ((.cse58 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse58 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse58 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse57 .cse9 (store (select .cse57 .cse9) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7))))) .cse2))) (or (and (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (let ((.cse61 (let ((.cse62 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse62 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse62 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse61 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse60 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse59 v_ArrVal_969) .cse60)) (= (select (select .cse59 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse60) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse12) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (let ((.cse65 (let ((.cse66 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse66 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse66 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse65 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse64 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse63 v_ArrVal_969) .cse64))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse63 v_arrayElimCell_86) .cse64)) (= (select (select .cse63 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse64) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse23 .cse56) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (let ((.cse69 (let ((.cse70 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse70 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse70 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse69 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse68 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse67 v_arrayElimCell_86) .cse68)) (= (select (select .cse67 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse68) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select (let ((.cse71 (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse72 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse72 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse71 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse37) (or .cse46 .cse17) (or .cse37 .cse36 .cse12) (or .cse12 .cse13 .cse2) (or .cse37 (and (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse73 (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse74 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse74 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse73 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (let ((.cse77 (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse78 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse78 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse77 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse76 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse75 v_ArrVal_969) .cse76))) (= (select (select .cse75 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse76) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse79 (let ((.cse80 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse80 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse80 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse79 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))))))))))) is different from false [2024-11-27 23:31:17,949 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse115 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse11 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv4 32)))) (let ((.cse116 (store (store (select .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse20 (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse116)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse23 (= .cse7 .cse6)) (.cse5 (select .cse20 .cse9))) (let ((.cse0 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (let ((.cse166 (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse167 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse167 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse166 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse166 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse165 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse164 v_ArrVal_969) .cse165))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse164 v_arrayElimCell_86) .cse165)))))) (.cse1 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse162 (let ((.cse163 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse163 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse163 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse162 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse162 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))))))) (.cse14 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (let ((.cse160 (let ((.cse161 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse161 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse161 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse160 .cse9 (store (select .cse160 .cse9) .cse6 v_ArrVal_972)))) (.cse159 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse158 v_arrayElimCell_86) .cse159))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse158 v_ArrVal_969) .cse159)))))) (.cse13 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse156 (let ((.cse157 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse157 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse157 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse156 .cse9 (store (select .cse156 .cse9) .cse6 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))))) (.cse51 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select (let ((.cse154 (let ((.cse155 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse155 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse155 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse154 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse154 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse12 (not .cse23)) (.cse2 (not .cse37))) (let ((.cse16 (and (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (let ((.cse111 (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse112 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse112 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse111 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse111 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse110 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse109 v_arrayElimCell_86) .cse110)) (= (select (select .cse109 v_arrayElimCell_90) .cse110) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (let ((.cse117 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse117 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse117 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse114 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse113 v_arrayElimCell_90) .cse114))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse113 v_arrayElimCell_86) .cse114)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse113 v_ArrVal_969) .cse114))))) (or (and (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse118 (let ((.cse119 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse119 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse119 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse118 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse118 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))))) .cse0 .cse1) .cse2) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (let ((.cse122 (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse123 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse123 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse122 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse122 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse121 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse120 v_ArrVal_969) .cse121))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse120 v_arrayElimCell_86) .cse121)) (= (select (select .cse120 v_arrayElimCell_90) .cse121) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse37 .cse12 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (let ((.cse126 (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse127 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse127 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse126 .cse9 (store (select .cse126 .cse9) .cse6 v_ArrVal_972)))) (.cse125 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse124 v_arrayElimCell_90) .cse125) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_ArrVal_969) .cse125)))))) (or .cse12 (and .cse14 (or .cse37 .cse13))) (or .cse37 (and (or .cse51 .cse23) (or .cse12 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (let ((.cse130 (let ((.cse131 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse131 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse131 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse130 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse130 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse129 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse128 v_ArrVal_969) .cse129)) (= (select (select .cse128 v_arrayElimCell_90) .cse129) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (let ((.cse134 (let ((.cse135 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse135 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse135 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse134 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse134 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse133 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse132 v_ArrVal_969) .cse133))) (= (select (select .cse132 v_arrayElimCell_90) .cse133) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select (let ((.cse136 (let ((.cse137 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse137 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse137 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse136 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse136 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)) (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (or (and (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (let ((.cse140 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse140 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse140 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse139 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse138 v_arrayElimCell_90) .cse139))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse138 v_ArrVal_969) .cse139))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse141 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse141 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse141 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse2)) .cse12) (or .cse37 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse142 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse142 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse142 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (let ((.cse145 (let ((.cse146 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse146 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse146 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse145 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse145 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse144 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse143 v_arrayElimCell_90) .cse144) |c_ULTIMATE.start_main_~uneq~0#1|)) (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse143 v_arrayElimCell_86) .cse144)))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse149 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse149 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse148 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse147 v_arrayElimCell_86) .cse148)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse147 v_ArrVal_969) .cse148))))) .cse2) (or .cse23 (and (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (let ((.cse152 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse152 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse152 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse151 (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse150 v_arrayElimCell_90) .cse151))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse150 v_arrayElimCell_86) .cse151))))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse153 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse153 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse153 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse116 .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse2))))) (.cse15 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (.cse56 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (let ((.cse107 (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse108 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse108 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse107 .cse9 (store (select .cse107 .cse9) .cse6 v_ArrVal_972)))) (.cse106 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse106)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 v_arrayElimCell_86) .cse106)))))) (.cse46 (and (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (let ((.cse87 (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse88 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse88 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse87 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse86 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse85 v_arrayElimCell_86) .cse86)) (= (select (select .cse85 v_arrayElimCell_90) .cse86) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (let ((.cse91 (let ((.cse92 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse92 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse92 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse91 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse91 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse90 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse89 v_ArrVal_969) .cse90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse89 v_arrayElimCell_86) .cse90)) (= (select (select .cse89 v_arrayElimCell_90) .cse90) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (let ((.cse95 (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse96 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse96 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse95 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse95 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse94 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse93 v_arrayElimCell_86) .cse94)) (= (select (select .cse93 v_arrayElimCell_90) .cse94) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) .cse23) (or .cse37 (and (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (let ((.cse99 (let ((.cse100 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse100 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse100 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse99 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse99 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse98 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse97 v_ArrVal_969) .cse98))) (= (select (select .cse97 v_arrayElimCell_90) .cse98) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse101 (let ((.cse102 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse102 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse102 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse101 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse101 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse103 (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse104 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse104 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse103 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse103 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))))))) (.cse17 (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (.cse36 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (let ((.cse83 (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse84 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse84 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse83 .cse9 (store (select .cse83 .cse9) .cse6 v_ArrVal_972)))) (.cse82 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse81 v_arrayElimCell_86) .cse82)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse81 v_ArrVal_969) .cse82))))))) (and (or (and .cse0 .cse1) .cse2) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse8 (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse6 v_ArrVal_972)))) (.cse4 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 v_arrayElimCell_86) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 v_ArrVal_969) .cse4))))) (or .cse12 .cse13) (or .cse14 .cse2) (or .cse15 .cse16) (or .cse17 .cse16) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (let ((.cse21 (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse21 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse19 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_ArrVal_969) .cse19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_86) .cse19)) (= (select (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse19) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (let ((.cse26 (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse26 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse25 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_86) .cse25)) (= (select (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse25) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (let ((.cse30 (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse30 .cse9 (store (select .cse30 .cse9) .cse6 v_ArrVal_972)))) (.cse29 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse29)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_86) .cse29))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_ArrVal_969) .cse29))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (let ((.cse34 (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse34 .cse9 (store (select .cse34 .cse9) .cse6 v_ArrVal_972)))) (.cse33 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 v_ArrVal_969) .cse33))))) .cse12) (or .cse36 .cse2) (or .cse36 .cse12) (or (and (or .cse37 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select (let ((.cse38 (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse39 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse39 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse38 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (let ((.cse42 (let ((.cse43 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse43 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse42 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse41 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse40 v_arrayElimCell_90) .cse41) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 v_arrayElimCell_86) .cse41)))))))) .cse17) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse44 (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse45 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse45 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse44 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse2) (or .cse15 .cse46) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (let ((.cse49 (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse50 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse50 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse49 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse48 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse47 v_arrayElimCell_86) .cse48)) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse48) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse17 (and (or .cse51 .cse37) (or .cse1 .cse2) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse54 (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse55 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse55 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse54 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse53 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse52 v_arrayElimCell_90) .cse53) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_86) .cse53))))))))) (or .cse23 (and .cse56 (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse57 (let ((.cse58 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse58 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse58 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse57 .cse9 (store (select .cse57 .cse9) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7))))) .cse2))) (or (and (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (let ((.cse61 (let ((.cse62 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse62 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse62 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse61 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse60 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse59 v_ArrVal_969) .cse60)) (= (select (select .cse59 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse60) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse12) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (let ((.cse65 (let ((.cse66 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse66 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse66 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse65 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse64 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse63 v_ArrVal_969) .cse64))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse63 v_arrayElimCell_86) .cse64)) (= (select (select .cse63 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse64) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse23 .cse56) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (let ((.cse69 (let ((.cse70 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse70 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse70 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse69 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse68 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse67 v_arrayElimCell_86) .cse68)) (= (select (select .cse67 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse68) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select (let ((.cse71 (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse72 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse72 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse71 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse37) (or .cse46 .cse17) (or .cse37 .cse36 .cse12) (or .cse12 .cse13 .cse2) (or .cse37 (and (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse73 (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse74 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse74 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse73 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (let ((.cse77 (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse78 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse78 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse77 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972)))) (.cse76 (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse75 v_ArrVal_969) .cse76))) (= (select (select .cse75 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse76) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.base| (_ BitVec 32))) (or (= .cse9 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse79 (let ((.cse80 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_965))) (store .cse80 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse80 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse79 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))))))))))) is different from true [2024-11-27 23:32:07,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse169 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse106 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse169 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse11 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv4 32))) (.cse168 (select .cse169 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse107 (store (store (select .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse168))) (let ((.cse20 (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse107)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) .cse168))) (let ((.cse12 (= .cse7 .cse6)) (.cse0 (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse5 (select .cse20 .cse9))) (let ((.cse33 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse166 (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse167 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse167 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse166 .cse9 (store (select .cse166 .cse9) .cse6 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse32 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (let ((.cse164 (let ((.cse165 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse165 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse165 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse164 .cse9 (store (select .cse164 .cse9) .cse6 v_ArrVal_972)))) (.cse163 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse162 v_ArrVal_969) .cse163) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse162 v_arrayElimCell_86) .cse163))))))) (.cse31 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_12 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (let ((.cse160 (let ((.cse161 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse161 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse161 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse160 v_subst_12 (store (select .cse160 v_subst_12) .cse6 v_ArrVal_972)))) (.cse159 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_12 (store (select .cse20 v_subst_12) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse158 v_ArrVal_969) .cse159) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse158 v_arrayElimCell_86) .cse159)))))) (.cse24 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_8 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse156 (let ((.cse157 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse157 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse157 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse156 v_subst_8 (store (select .cse156 v_subst_8) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_8 (store (select .cse20 v_subst_8) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse9 v_subst_8)))) (.cse16 (not .cse0)) (.cse1 (not .cse12)) (.cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_10 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse154 (let ((.cse155 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse155 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse155 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse154 v_subst_10 (store (select .cse154 v_subst_10) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (select (select (store .cse20 v_subst_10 (store (select .cse20 v_subst_10) .cse6 v_ArrVal_966)) .cse9) .cse7) (_ bv8 32)))) (= v_subst_10 .cse9))))) (let ((.cse2 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (let ((.cse152 (let ((.cse153 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse153 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse153 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse152 .cse9 (store (select .cse152 .cse9) .cse6 v_ArrVal_972)))) (.cse151 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse150 v_ArrVal_969) .cse151) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse150 v_arrayElimCell_86) .cse151)))))) (.cse29 (and (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse105 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse105 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse105 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse0) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_18 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (let ((.cse110 (let ((.cse111 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse111 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse111 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse110 v_subst_18 (store (select .cse110 v_subst_18) .cse6 v_ArrVal_972)))) (.cse109 (bvadd (select (select (store .cse20 v_subst_18 (store (select .cse20 v_subst_18) .cse6 v_ArrVal_966)) .cse9) .cse7) (_ bv8 32)))) (or (= v_subst_18 .cse9) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse108 v_arrayElimCell_86) .cse109))) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse108 v_arrayElimCell_90) .cse109)))))) (or (and (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse114 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse114 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse113 (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse112 v_arrayElimCell_86) .cse113)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse112 v_arrayElimCell_90) .cse113)))))) (or .cse16 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse115 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7))))))) .cse12) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse118 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse118 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse117 (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse116 v_arrayElimCell_86) .cse117)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse116 v_ArrVal_969) .cse117))))) .cse16) (or .cse1 (and (or .cse0 .cse33) .cse32)) (or .cse0 .cse1 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (let ((.cse121 (let ((.cse122 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse122 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse122 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse121 .cse9 (store (select .cse121 .cse9) .cse6 v_ArrVal_972)))) (.cse120 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse119 v_ArrVal_969) .cse120) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse119 v_arrayElimCell_90) .cse120)))))) (or .cse1 (and (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse123 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse123 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse16) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (let ((.cse126 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse126 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse126 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse125 (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_ArrVal_969) .cse125)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_arrayElimCell_90) .cse125)))))))) (or (and (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_subst_13 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse127 (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse128 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse128 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse127 v_subst_13 (store (select .cse127 v_subst_13) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_13 (store (select .cse20 v_subst_13) .cse6 v_ArrVal_966)) .cse9) .cse7))))) .cse12) .cse31 .cse24) .cse16) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_subst_17 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse129 (let ((.cse131 (let ((.cse132 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse132 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse132 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse131 v_subst_17 (store (select .cse131 v_subst_17) .cse6 v_ArrVal_972)))) (.cse130 (bvadd (select (select (store .cse20 v_subst_17 (store (select .cse20 v_subst_17) .cse6 v_ArrVal_966)) .cse9) .cse7) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse129 v_arrayElimCell_90) .cse130)) (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse129 v_ArrVal_969) .cse130) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse129 v_arrayElimCell_86) .cse130) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (let ((.cse135 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse135 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select .cse135 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968) .cse6 v_ArrVal_972)))) (.cse134 (bvadd (_ bv8 32) (select (select (store .cse106 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store .cse107 .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse133 v_arrayElimCell_86) .cse134)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse133 v_ArrVal_969) .cse134)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse133 v_arrayElimCell_90) .cse134)))))) (or .cse12 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_11 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (let ((.cse138 (let ((.cse139 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse139 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse139 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse138 v_subst_11 (store (select .cse138 v_subst_11) .cse6 v_ArrVal_972)))) (.cse137 (bvadd (select (select (store .cse20 v_subst_11 (store (select .cse20 v_subst_11) .cse6 v_ArrVal_966)) .cse9) .cse7) (_ bv8 32)))) (or (= (select (select .cse136 v_arrayElimCell_86) .cse137) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_arrayElimCell_90) .cse137)))))) (or .cse0 (and (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_14 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_14 .cse9) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select (let ((.cse140 (let ((.cse141 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse141 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse141 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse140 v_subst_14 (store (select .cse140 v_subst_14) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_14 (store (select .cse20 v_subst_14) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_subst_16 (_ BitVec 32))) (or (= v_subst_16 .cse9) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (let ((.cse144 (let ((.cse145 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse145 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse145 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse144 v_subst_16 (store (select .cse144 v_subst_16) .cse6 v_ArrVal_972)))) (.cse143 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_16 (store (select .cse20 v_subst_16) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse142 v_ArrVal_969) .cse143))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse142 v_arrayElimCell_90) .cse143))))))) (or .cse1 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_15 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse146 (let ((.cse148 (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse149 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse149 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse148 v_subst_15 (store (select .cse148 v_subst_15) .cse6 v_ArrVal_972)))) (.cse147 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_15 (store (select .cse20 v_subst_15) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= (select (select .cse146 v_arrayElimCell_90) .cse147) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse146 v_ArrVal_969) .cse147)))))) (or .cse12 .cse23))))) (.cse13 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (let ((.cse103 (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse104 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse104 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse103 .cse9 (store (select .cse103 .cse9) .cse6 v_ArrVal_972)))) (.cse102 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse101 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse102)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse101 v_arrayElimCell_86) .cse102)))))) (.cse17 (= .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse62 (and (forall ((v_subst_3 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (let ((.cse83 (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse84 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse84 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse83 v_subst_3 (store (select .cse83 v_subst_3) .cse6 v_ArrVal_972)))) (.cse82 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_3 (store (select .cse20 v_subst_3) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse81 v_arrayElimCell_90) .cse82)) (= (select (select .cse81 v_arrayElimCell_86) .cse82) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= .cse9 v_subst_3) (= v_subst_3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse0 (and (forall ((v_subst_6 (_ BitVec 32))) (or (= v_subst_6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (let ((.cse87 (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse88 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse88 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse87 v_subst_6 (store (select .cse87 v_subst_6) .cse6 v_ArrVal_972)))) (.cse86 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_6 (store (select .cse20 v_subst_6) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse85 v_ArrVal_969) .cse86))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse85 v_arrayElimCell_90) .cse86))))))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_subst_4 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse89 (let ((.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse90 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse90 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse89 v_subst_4 (store (select .cse89 v_subst_4) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_4 (store (select .cse20 v_subst_4) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= v_subst_4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse12) (forall ((v_subst_5 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse91 (let ((.cse92 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse92 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse92 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse91 v_subst_5 (store (select .cse91 v_subst_5) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_5 (store (select .cse20 v_subst_5) .cse6 v_ArrVal_966)) .cse9) .cse7))))) (= .cse9 v_subst_5) (= v_subst_5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) (forall ((v_subst_2 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (let ((.cse95 (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse96 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse96 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse95 v_subst_2 (store (select .cse95 v_subst_2) .cse6 v_ArrVal_972)))) (.cse94 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_2 (store (select .cse20 v_subst_2) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse93 v_arrayElimCell_86) .cse94)) (= (select (select .cse93 v_arrayElimCell_90) .cse94) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse93 v_ArrVal_969) .cse94)))))) (= v_subst_2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse12 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_7 (_ BitVec 32))) (let ((.cse97 (let ((.cse99 (let ((.cse100 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse100 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse100 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse99 v_subst_7 (store (select .cse99 v_subst_7) .cse6 v_ArrVal_972)))) (.cse98 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_7 (store (select .cse20 v_subst_7) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= v_subst_7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (= (select (select .cse97 v_arrayElimCell_90) .cse98) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse97 v_arrayElimCell_86) .cse98)))))))) (.cse30 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (or .cse0 .cse1 .cse2) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse8 (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse6 v_ArrVal_972)))) (.cse4 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse3 v_ArrVal_969) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse3 v_arrayElimCell_86) .cse4)))))) (or .cse12 (and .cse13 (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse14 (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse14 .cse9 (store (select .cse14 .cse9) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7))))) .cse16))) (or .cse17 (and (forall ((v_subst_9 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (let ((.cse21 (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse21 v_subst_9 (store (select .cse21 v_subst_9) .cse6 v_ArrVal_972)))) (.cse19 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_9 (store (select .cse20 v_subst_9) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_86) .cse19)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_90) .cse19)))))) (= .cse9 v_subst_9))) (or .cse0 .cse23) (or .cse16 .cse24))) (or .cse16 .cse2) (forall ((v_subst_20 (_ BitVec 32))) (or (= v_subst_20 .cse9) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (let ((.cse27 (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse27 v_subst_20 (store (select .cse27 v_subst_20) .cse6 v_ArrVal_972)))) (.cse26 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_20 (store (select .cse20 v_subst_20) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 v_arrayElimCell_86) .cse26)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse26))))) (= v_subst_20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse29 .cse30) (or (and .cse31 .cse24) .cse16) (or .cse1 .cse2) (or .cse32 .cse16) (or .cse29 .cse17) (or .cse1 .cse33) (forall ((v_subst_19 (_ BitVec 32))) (or (= v_subst_19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (let ((.cse36 (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse37 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse37 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse36 v_subst_19 (store (select .cse36 v_subst_19) .cse6 v_ArrVal_972)))) (.cse35 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_19 (store (select .cse20 v_subst_19) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 v_ArrVal_969) .cse35))) (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse35) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 v_arrayElimCell_86) .cse35))))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (let ((.cse40 (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse41 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse41 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse40 .cse9 (store (select .cse40 .cse9) .cse6 v_ArrVal_972)))) (.cse39 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse38 v_ArrVal_969) .cse39) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse39)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_86) .cse39))))) (or .cse0 (and (or .cse13 .cse12) (or .cse1 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_25 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (let ((.cse44 (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse45 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse45 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse44 v_subst_25 (store (select .cse44 v_subst_25) .cse6 v_ArrVal_972)))) (.cse43 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_25 (store (select .cse20 v_subst_25) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= (select (select .cse42 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse43) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse42 v_ArrVal_969) .cse43)))))) (or .cse12 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_28 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (let ((.cse48 (let ((.cse49 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse49 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse49 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse48 v_subst_28 (store (select .cse48 v_subst_28) .cse6 v_ArrVal_972)))) (.cse47 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_28 (store (select .cse20 v_subst_28) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse46 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse46 v_arrayElimCell_86) .cse47)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_27 (_ BitVec 32))) (or (= v_subst_27 .cse9) (= (select (select (let ((.cse50 (let ((.cse51 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse51 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse51 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse50 v_subst_27 (store (select .cse50 v_subst_27) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_27 (store (select .cse20 v_subst_27) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_26 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse54 (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse55 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse55 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse54 v_subst_26 (store (select .cse54 v_subst_26) .cse6 v_ArrVal_972)))) (.cse53 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_26 (store (select .cse20 v_subst_26) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_ArrVal_969) .cse53))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse53)) (= (select (select .cse52 v_arrayElimCell_86) .cse53) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse1 .cse33 .cse16) (or .cse17 (and (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_subst_29 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_29 .cse9) (= v_subst_29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse56 (let ((.cse57 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse57 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse57 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse56 v_subst_29 (store (select .cse56 v_subst_29) .cse6 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_29 (store (select .cse20 v_subst_29) .cse6 v_ArrVal_966)) .cse9) .cse7)))))) .cse0) (forall ((v_subst_30 (_ BitVec 32))) (or (= v_subst_30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (let ((.cse60 (let ((.cse61 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse61 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse61 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse60 v_subst_30 (store (select .cse60 v_subst_30) .cse6 v_ArrVal_972)))) (.cse59 (bvadd (select (select (store .cse20 v_subst_30 (store (select .cse20 v_subst_30) .cse6 v_ArrVal_966)) .cse9) .cse7) (_ bv8 32)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 v_arrayElimCell_90) .cse59))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 v_arrayElimCell_86) .cse59))))) (= v_subst_30 .cse9))))) (or .cse17 .cse62) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_21 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse63 (let ((.cse64 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse64 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse64 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse63 v_subst_21 (store (select .cse63 v_subst_21) .cse6 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_21 (store (select .cse20 v_subst_21) .cse6 v_ArrVal_966)) .cse9) .cse7)))))) .cse16) (or .cse1 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (let ((.cse67 (let ((.cse68 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse68 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse68 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse67 .cse9 (store (select .cse67 .cse9) .cse6 v_ArrVal_972)))) (.cse66 (bvadd (_ bv8 32) (select (store .cse5 .cse6 v_ArrVal_966) .cse7)))) (or (= (select (select .cse65 v_ArrVal_969) .cse66) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse65 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse66)))))) (or .cse62 .cse30) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_1 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (let ((.cse71 (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse72 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse72 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse71 v_subst_1 (store (select .cse71 v_subst_1) .cse6 v_ArrVal_972)))) (.cse70 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_1 (store (select .cse20 v_subst_1) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse69 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse70)) (= v_subst_1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (= (select (select .cse69 v_arrayElimCell_86) .cse70) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse12) (or .cse0 (and (forall ((v_subst_24 (_ BitVec 32))) (or (= v_subst_24 .cse9) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse73 (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse74 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse74 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse73 v_subst_24 (store (select .cse73 v_subst_24) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_24 (store (select .cse20 v_subst_24) .cse6 v_ArrVal_966)) .cse9) .cse7))))) (= v_subst_24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (or .cse12 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_22 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse75 (let ((.cse76 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse76 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse76 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse75 v_subst_22 (store (select .cse75 v_subst_22) .cse6 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_22 (store (select .cse20 v_subst_22) .cse6 v_ArrVal_966)) .cse9) .cse7))) |c_ULTIMATE.start_main_~uneq~0#1|) (= v_subst_22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (forall ((v_subst_23 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (let ((.cse79 (let ((.cse80 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_965))) (store .cse80 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse80 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse11 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_968))))) (store .cse79 v_subst_23 (store (select .cse79 v_subst_23) .cse6 v_ArrVal_972)))) (.cse78 (bvadd (_ bv8 32) (select (select (store .cse20 v_subst_23 (store (select .cse20 v_subst_23) .cse6 v_ArrVal_966)) .cse9) .cse7)))) (or (= (select (select .cse77 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse78) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse77 v_ArrVal_969) .cse78)))))) (= v_subst_23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))))))))))) is different from false [2024-11-27 23:33:03,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse171 (select |c_#memory_$Pointer$#1.offset| .cse9)) (.cse131 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse97 (store |c_#memory_$Pointer$#1.offset| .cse9 (store .cse171 .cse131 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (.cse8 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv4 32))) (.cse170 (select .cse171 .cse131))) (let ((.cse98 (store (store (select .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 .cse131) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse170))) (let ((.cse2 (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| .cse98)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) .cse170)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse10 (= .cse5 .cse3)) (.cse30 (select .cse2 .cse4))) (let ((.cse76 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_10 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse168 (let ((.cse169 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse169 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse169 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse168 v_subst_10 (store (select .cse168 v_subst_10) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (select (select (store .cse2 v_subst_10 (store (select .cse2 v_subst_10) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32))) |c_ULTIMATE.start_main_~uneq~0#1|) (= v_subst_10 .cse4)))) (.cse35 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse166 (let ((.cse167 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse167 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse167 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse166 .cse4 (store (select .cse166 .cse4) .cse3 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))))) (.cse81 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (let ((.cse164 (let ((.cse165 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse165 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse165 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse164 .cse4 (store (select .cse164 .cse4) .cse3 v_ArrVal_972)))) (.cse163 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse162 v_ArrVal_969) .cse163)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse162 v_arrayElimCell_86) .cse163))))))) (.cse50 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_8 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse160 (let ((.cse161 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse161 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse161 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse160 v_subst_8 (store (select .cse160 v_subst_8) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (select (select (store .cse2 v_subst_8 (store (select .cse2 v_subst_8) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (= .cse4 v_subst_8)))) (.cse51 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_12 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (let ((.cse158 (let ((.cse159 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse159 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse159 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse158 v_subst_12 (store (select .cse158 v_subst_12) .cse3 v_ArrVal_972)))) (.cse157 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_12 (store (select .cse2 v_subst_12) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse156 v_arrayElimCell_86) .cse157)) (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse156 v_ArrVal_969) .cse157) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse17 (not .cse10)) (.cse47 (not .cse23))) (let ((.cse45 (and (forall ((v_subst_2 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (let ((.cse138 (let ((.cse139 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse139 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse139 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse138 v_subst_2 (store (select .cse138 v_subst_2) .cse3 v_ArrVal_972)))) (.cse137 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_2 (store (select .cse2 v_subst_2) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_arrayElimCell_90) .cse137)) (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_ArrVal_969) .cse137))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_arrayElimCell_86) .cse137))))) (= v_subst_2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_7 (_ BitVec 32))) (let ((.cse140 (let ((.cse142 (let ((.cse143 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse143 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse143 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse142 v_subst_7 (store (select .cse142 v_subst_7) .cse3 v_ArrVal_972)))) (.cse141 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_7 (store (select .cse2 v_subst_7) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= v_subst_7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse140 v_arrayElimCell_90) .cse141)) (= (select (select .cse140 v_arrayElimCell_86) .cse141) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_subst_3 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse144 (let ((.cse146 (let ((.cse147 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse147 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse147 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse146 v_subst_3 (store (select .cse146 v_subst_3) .cse3 v_ArrVal_972)))) (.cse145 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_3 (store (select .cse2 v_subst_3) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse144 v_arrayElimCell_90) .cse145)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse144 v_arrayElimCell_86) .cse145))))) (= .cse4 v_subst_3) (= v_subst_3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or .cse23 (and (forall ((v_subst_6 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (let ((.cse150 (let ((.cse151 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse151 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse151 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse150 v_subst_6 (store (select .cse150 v_subst_6) .cse3 v_ArrVal_972)))) (.cse149 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_6 (store (select .cse2 v_subst_6) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse148 v_ArrVal_969) .cse149))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse148 v_arrayElimCell_90) .cse149))))) (= v_subst_6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (forall ((v_subst_5 (_ BitVec 32))) (or (= .cse4 v_subst_5) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse152 (let ((.cse153 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse153 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse153 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse152 v_subst_5 (store (select .cse152 v_subst_5) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_5 (store (select .cse2 v_subst_5) .cse3 v_ArrVal_966)) .cse4) .cse5))))) (= v_subst_5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_subst_4 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse154 (let ((.cse155 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse155 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse155 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse154 v_subst_4 (store (select .cse154 v_subst_4) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_4 (store (select .cse2 v_subst_4) .cse3 v_ArrVal_966)) .cse4) .cse5))))))))))) (.cse22 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (let ((.cse134 (let ((.cse135 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse135 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse135 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse134 .cse4 (store (select .cse134 .cse4) .cse3 v_ArrVal_972)))) (.cse133 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse132 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse133)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse132 v_arrayElimCell_86) .cse133)))))) (.cse44 (= .cse5 .cse131)) (.cse34 (and (or (and (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_15 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (let ((.cse88 (let ((.cse89 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse89 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse89 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse88 v_subst_15 (store (select .cse88 v_subst_15) .cse3 v_ArrVal_972)))) (.cse87 (bvadd (select (select (store .cse2 v_subst_15 (store (select .cse2 v_subst_15) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= (select (select .cse86 v_arrayElimCell_90) .cse87) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse86 v_ArrVal_969) .cse87)))))) (or .cse10 .cse76) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_14 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_14 .cse4) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select (let ((.cse90 (let ((.cse91 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse91 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse91 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse90 v_subst_14 (store (select .cse90 v_subst_14) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_14 (store (select .cse2 v_subst_14) .cse3 v_ArrVal_966)) .cse4) .cse5))) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_subst_16 (_ BitVec 32))) (or (= v_subst_16 .cse4) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (let ((.cse94 (let ((.cse95 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse95 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse95 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse94 v_subst_16 (store (select .cse94 v_subst_16) .cse3 v_ArrVal_972)))) (.cse93 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_16 (store (select .cse2 v_subst_16) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse92 v_ArrVal_969) .cse93))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse92 v_arrayElimCell_90) .cse93)))))))) .cse23) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse96 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse96 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse96 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))))) (or .cse17 (and (or .cse23 .cse35) .cse81)) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (let ((.cse101 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse101 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse101 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse100 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse99 v_arrayElimCell_86) .cse100)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse99 v_ArrVal_969) .cse100)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse99 v_arrayElimCell_90) .cse100)))))) (or .cse47 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (let ((.cse104 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse104 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse104 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse103 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse102 v_arrayElimCell_86) .cse103)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse102 v_ArrVal_969) .cse103)))))) (or .cse17 (and (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (let ((.cse107 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse107 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse107 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse106 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 v_ArrVal_969) .cse106)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 v_arrayElimCell_90) .cse106)))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse108 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse108 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse108 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972))) v_ArrVal_969) (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32))))) .cse47))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_11 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (let ((.cse111 (let ((.cse112 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse112 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse112 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse111 v_subst_11 (store (select .cse111 v_subst_11) .cse3 v_ArrVal_972)))) (.cse110 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_11 (store (select .cse2 v_subst_11) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse109 v_arrayElimCell_86) .cse110)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse109 v_arrayElimCell_90) .cse110)))))) (or .cse47 (and (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_subst_13 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse113 (let ((.cse114 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse114 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse114 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse113 v_subst_13 (store (select .cse113 v_subst_13) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_13 (store (select .cse2 v_subst_13) .cse3 v_ArrVal_966)) .cse4) .cse5)))))) .cse50 .cse51)) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_subst_17 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (let ((.cse117 (let ((.cse118 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse118 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse118 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse117 v_subst_17 (store (select .cse117 v_subst_17) .cse3 v_ArrVal_972)))) (.cse116 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_17 (store (select .cse2 v_subst_17) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse115 v_ArrVal_969) .cse116) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse115 v_arrayElimCell_86) .cse116)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse115 v_arrayElimCell_90) .cse116))))) (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (let ((.cse121 (let ((.cse122 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse122 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse122 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse121 .cse4 (store (select .cse121 .cse4) .cse3 v_ArrVal_972)))) (.cse120 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse119 v_ArrVal_969) .cse120)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse119 v_arrayElimCell_90) .cse120))))) .cse23) (or .cse10 (and (or .cse47 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse123 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse123 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse123 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (let ((.cse126 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse126 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse126 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse125 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_arrayElimCell_86) .cse125)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_arrayElimCell_90) .cse125)))))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_18 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse127 (let ((.cse129 (let ((.cse130 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse130 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse130 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse129 v_subst_18 (store (select .cse129 v_subst_18) .cse3 v_ArrVal_972)))) (.cse128 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_18 (store (select .cse2 v_subst_18) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse127 v_arrayElimCell_86) .cse128))) (= v_subst_18 .cse4) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse127 v_arrayElimCell_90) .cse128) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse46 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (let ((.cse84 (let ((.cse85 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse85 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse85 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse84 .cse4 (store (select .cse84 .cse4) .cse3 v_ArrVal_972)))) (.cse83 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse82 v_ArrVal_969) .cse83)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse82 v_arrayElimCell_86) .cse83)))))) (.cse33 (= .cse4 .cse9))) (and (or (and (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_26 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (let ((.cse7 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse6 v_subst_26 (store (select .cse6 v_subst_26) .cse3 v_ArrVal_972)))) (.cse1 (bvadd (select (select (store .cse2 v_subst_26 (store (select .cse2 v_subst_26) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse0 v_ArrVal_969) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 v_arrayElimCell_86) .cse1)) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_28 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse13 v_subst_28 (store (select .cse13 v_subst_28) .cse3 v_ArrVal_972)))) (.cse12 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_28 (store (select .cse2 v_subst_28) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= (select (select .cse11 v_arrayElimCell_86) .cse12) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse12) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_27 (_ BitVec 32))) (or (= v_subst_27 .cse4) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse15 v_subst_27 (store (select .cse15 v_subst_27) .cse3 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_27 (store (select .cse2 v_subst_27) .cse3 v_ArrVal_966)) .cse4) .cse5)))))) (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_25 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse20 v_subst_25 (store (select .cse20 v_subst_25) .cse3 v_ArrVal_972)))) (.cse19 (bvadd (select (select (store .cse2 v_subst_25 (store (select .cse2 v_subst_25) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse19)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_ArrVal_969) .cse19)))))) (or .cse10 .cse22)) .cse23) (forall ((v_subst_19 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (let ((.cse26 (let ((.cse27 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse26 v_subst_19 (store (select .cse26 v_subst_19) .cse3 v_ArrVal_972)))) (.cse25 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_19 (store (select .cse2 v_subst_19) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse24 v_ArrVal_969) .cse25) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse25)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_86) .cse25))))) (= v_subst_19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (let ((.cse31 (let ((.cse32 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse31 .cse4 (store (select .cse31 .cse4) .cse3 v_ArrVal_972)))) (.cse29 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_ArrVal_969) .cse29)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_86) .cse29))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse29))))) (or .cse33 .cse34) (or .cse17 .cse35) (or .cse23 (and (forall ((v_subst_23 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (let ((.cse38 (let ((.cse39 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse39 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse39 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse38 v_subst_23 (store (select .cse38 v_subst_23) .cse3 v_ArrVal_972)))) (.cse37 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_23 (store (select .cse2 v_subst_23) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse36 v_ArrVal_969) .cse37))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse37))))) (= v_subst_23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (forall ((v_subst_24 (_ BitVec 32))) (or (= v_subst_24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= v_subst_24 .cse4) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse40 (let ((.cse41 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse41 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse41 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse40 v_subst_24 (store (select .cse40 v_subst_24) .cse3 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_24 (store (select .cse2 v_subst_24) .cse3 v_ArrVal_966)) .cse4) .cse5))))))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_22 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse43 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse42 v_subst_22 (store (select .cse42 v_subst_22) .cse3 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_22 (store (select .cse2 v_subst_22) .cse3 v_ArrVal_966)) .cse4) .cse5))) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse44 .cse45) (or .cse46 .cse47) (or .cse33 .cse45) (or .cse47 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_21 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse48 (let ((.cse49 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse49 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse49 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse48 v_subst_21 (store (select .cse48 v_subst_21) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_21 (store (select .cse2 v_subst_21) .cse3 v_ArrVal_966)) .cse4) .cse5))))))) (or .cse47 (and .cse50 .cse51)) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_1 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse54 (let ((.cse55 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse55 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse55 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse54 v_subst_1 (store (select .cse54 v_subst_1) .cse3 v_ArrVal_972)))) (.cse53 (bvadd (select (select (store .cse2 v_subst_1 (store (select .cse2 v_subst_1) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= v_subst_1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_86) .cse53)))))) (or .cse10 (and (or .cse47 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse56 (let ((.cse57 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse57 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse57 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse56 .cse4 (store (select .cse56 .cse4) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))))) .cse22)) (forall ((v_subst_20 (_ BitVec 32))) (or (= v_subst_20 .cse4) (= v_subst_20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (let ((.cse60 (let ((.cse61 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse61 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse61 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse60 v_subst_20 (store (select .cse60 v_subst_20) .cse3 v_ArrVal_972)))) (.cse59 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_20 (store (select .cse2 v_subst_20) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 v_arrayElimCell_86) .cse59))))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (let ((.cse64 (let ((.cse65 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse65 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse65 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse64 .cse4 (store (select .cse64 .cse4) .cse3 v_ArrVal_972)))) (.cse63 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 v_ArrVal_969) .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 v_arrayElimCell_86) .cse63))))) (or .cse33 (and (forall ((v_subst_30 (_ BitVec 32))) (or (= v_subst_30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (let ((.cse68 (let ((.cse69 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse69 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse69 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse68 v_subst_30 (store (select .cse68 v_subst_30) .cse3 v_ArrVal_972)))) (.cse67 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_30 (store (select .cse2 v_subst_30) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse66 v_arrayElimCell_90) .cse67) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 v_arrayElimCell_86) .cse67))))) (= v_subst_30 .cse4))) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_subst_29 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_29 .cse4) (= v_subst_29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse70 (let ((.cse71 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse71 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse71 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse70 v_subst_29 (store (select .cse70 v_subst_29) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_29 (store (select .cse2 v_subst_29) .cse3 v_ArrVal_966)) .cse4) .cse5))))))))) (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (let ((.cse74 (let ((.cse75 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse75 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse75 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse74 .cse4 (store (select .cse74 .cse4) .cse3 v_ArrVal_972)))) (.cse73 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse72 v_ArrVal_969) .cse73)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse72 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse73)))))) (or .cse44 .cse34) (or .cse17 .cse46 .cse23) (or .cse17 .cse46) (or .cse33 (and (or .cse23 .cse76) (forall ((v_subst_9 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (let ((.cse79 (let ((.cse80 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse80 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse80 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse79 v_subst_9 (store (select .cse79 v_subst_9) .cse3 v_ArrVal_972)))) (.cse78 (bvadd (select (select (store .cse2 v_subst_9 (store (select .cse2 v_subst_9) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse77 v_arrayElimCell_90) .cse78))) (= (select (select .cse77 v_arrayElimCell_86) .cse78) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= .cse4 v_subst_9))) (or .cse47 .cse50))) (or .cse81 .cse47) (or .cse17 .cse47 .cse35)))))))))) is different from false [2024-11-27 23:33:07,723 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse171 (select |c_#memory_$Pointer$#1.offset| .cse9)) (.cse131 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse97 (store |c_#memory_$Pointer$#1.offset| .cse9 (store .cse171 .cse131 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (.cse8 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv4 32))) (.cse170 (select .cse171 .cse131))) (let ((.cse98 (store (store (select .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 .cse131) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse170))) (let ((.cse2 (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| .cse98)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) .cse170)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse10 (= .cse5 .cse3)) (.cse30 (select .cse2 .cse4))) (let ((.cse76 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_10 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse168 (let ((.cse169 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse169 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse169 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse168 v_subst_10 (store (select .cse168 v_subst_10) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (select (select (store .cse2 v_subst_10 (store (select .cse2 v_subst_10) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32))) |c_ULTIMATE.start_main_~uneq~0#1|) (= v_subst_10 .cse4)))) (.cse35 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse166 (let ((.cse167 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse167 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse167 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse166 .cse4 (store (select .cse166 .cse4) .cse3 v_ArrVal_972))) v_ArrVal_969) (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))))) (.cse81 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (let ((.cse164 (let ((.cse165 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse165 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse165 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse164 .cse4 (store (select .cse164 .cse4) .cse3 v_ArrVal_972)))) (.cse163 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse162 v_ArrVal_969) .cse163)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse162 v_arrayElimCell_86) .cse163))))))) (.cse50 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_8 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse160 (let ((.cse161 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse161 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse161 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse160 v_subst_8 (store (select .cse160 v_subst_8) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (select (select (store .cse2 v_subst_8 (store (select .cse2 v_subst_8) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (= .cse4 v_subst_8)))) (.cse51 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_12 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (let ((.cse158 (let ((.cse159 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse159 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse159 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse158 v_subst_12 (store (select .cse158 v_subst_12) .cse3 v_ArrVal_972)))) (.cse157 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_12 (store (select .cse2 v_subst_12) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse156 v_arrayElimCell_86) .cse157)) (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse156 v_ArrVal_969) .cse157) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse17 (not .cse10)) (.cse47 (not .cse23))) (let ((.cse45 (and (forall ((v_subst_2 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (let ((.cse138 (let ((.cse139 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse139 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse139 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse138 v_subst_2 (store (select .cse138 v_subst_2) .cse3 v_ArrVal_972)))) (.cse137 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_2 (store (select .cse2 v_subst_2) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_arrayElimCell_90) .cse137)) (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_ArrVal_969) .cse137))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse136 v_arrayElimCell_86) .cse137))))) (= v_subst_2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_7 (_ BitVec 32))) (let ((.cse140 (let ((.cse142 (let ((.cse143 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse143 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse143 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse142 v_subst_7 (store (select .cse142 v_subst_7) .cse3 v_ArrVal_972)))) (.cse141 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_7 (store (select .cse2 v_subst_7) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= v_subst_7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse140 v_arrayElimCell_90) .cse141)) (= (select (select .cse140 v_arrayElimCell_86) .cse141) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_subst_3 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse144 (let ((.cse146 (let ((.cse147 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse147 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse147 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse146 v_subst_3 (store (select .cse146 v_subst_3) .cse3 v_ArrVal_972)))) (.cse145 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_3 (store (select .cse2 v_subst_3) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse144 v_arrayElimCell_90) .cse145)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse144 v_arrayElimCell_86) .cse145))))) (= .cse4 v_subst_3) (= v_subst_3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or .cse23 (and (forall ((v_subst_6 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (let ((.cse150 (let ((.cse151 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse151 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse151 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse150 v_subst_6 (store (select .cse150 v_subst_6) .cse3 v_ArrVal_972)))) (.cse149 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_6 (store (select .cse2 v_subst_6) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse148 v_ArrVal_969) .cse149))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse148 v_arrayElimCell_90) .cse149))))) (= v_subst_6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (forall ((v_subst_5 (_ BitVec 32))) (or (= .cse4 v_subst_5) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse152 (let ((.cse153 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse153 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse153 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse152 v_subst_5 (store (select .cse152 v_subst_5) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_5 (store (select .cse2 v_subst_5) .cse3 v_ArrVal_966)) .cse4) .cse5))))) (= v_subst_5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_subst_4 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse154 (let ((.cse155 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse155 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse155 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse154 v_subst_4 (store (select .cse154 v_subst_4) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_4 (store (select .cse2 v_subst_4) .cse3 v_ArrVal_966)) .cse4) .cse5))))))))))) (.cse22 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (let ((.cse134 (let ((.cse135 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse135 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse135 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse134 .cse4 (store (select .cse134 .cse4) .cse3 v_ArrVal_972)))) (.cse133 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse132 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse133)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse132 v_arrayElimCell_86) .cse133)))))) (.cse44 (= .cse5 .cse131)) (.cse34 (and (or (and (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_15 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (let ((.cse88 (let ((.cse89 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse89 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse89 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse88 v_subst_15 (store (select .cse88 v_subst_15) .cse3 v_ArrVal_972)))) (.cse87 (bvadd (select (select (store .cse2 v_subst_15 (store (select .cse2 v_subst_15) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= (select (select .cse86 v_arrayElimCell_90) .cse87) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse86 v_ArrVal_969) .cse87)))))) (or .cse10 .cse76) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_14 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_14 .cse4) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select (let ((.cse90 (let ((.cse91 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse91 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse91 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse90 v_subst_14 (store (select .cse90 v_subst_14) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_14 (store (select .cse2 v_subst_14) .cse3 v_ArrVal_966)) .cse4) .cse5))) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_subst_16 (_ BitVec 32))) (or (= v_subst_16 .cse4) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (let ((.cse94 (let ((.cse95 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse95 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse95 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse94 v_subst_16 (store (select .cse94 v_subst_16) .cse3 v_ArrVal_972)))) (.cse93 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_16 (store (select .cse2 v_subst_16) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse92 v_ArrVal_969) .cse93))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse92 v_arrayElimCell_90) .cse93)))))))) .cse23) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse96 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse96 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse96 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))))) (or .cse17 (and (or .cse23 .cse35) .cse81)) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (let ((.cse101 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse101 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse101 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse100 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse99 v_arrayElimCell_86) .cse100)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse99 v_ArrVal_969) .cse100)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse99 v_arrayElimCell_90) .cse100)))))) (or .cse47 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (let ((.cse104 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse104 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse104 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse103 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse102 v_arrayElimCell_86) .cse103)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse102 v_ArrVal_969) .cse103)))))) (or .cse17 (and (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (let ((.cse107 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse107 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse107 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse106 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 v_ArrVal_969) .cse106)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse105 v_arrayElimCell_90) .cse106)))))) (or (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse108 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse108 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse108 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972))) v_ArrVal_969) (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32))))) .cse47))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_11 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (let ((.cse111 (let ((.cse112 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse112 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse112 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse111 v_subst_11 (store (select .cse111 v_subst_11) .cse3 v_ArrVal_972)))) (.cse110 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_11 (store (select .cse2 v_subst_11) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse109 v_arrayElimCell_86) .cse110)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse109 v_arrayElimCell_90) .cse110)))))) (or .cse47 (and (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_subst_13 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse113 (let ((.cse114 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse114 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse114 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse113 v_subst_13 (store (select .cse113 v_subst_13) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_13 (store (select .cse2 v_subst_13) .cse3 v_ArrVal_966)) .cse4) .cse5)))))) .cse50 .cse51)) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_subst_17 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (let ((.cse117 (let ((.cse118 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse118 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse118 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse117 v_subst_17 (store (select .cse117 v_subst_17) .cse3 v_ArrVal_972)))) (.cse116 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_17 (store (select .cse2 v_subst_17) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse115 v_ArrVal_969) .cse116) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse115 v_arrayElimCell_86) .cse116)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse115 v_arrayElimCell_90) .cse116))))) (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (let ((.cse121 (let ((.cse122 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse122 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse122 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse121 .cse4 (store (select .cse121 .cse4) .cse3 v_ArrVal_972)))) (.cse120 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse119 v_ArrVal_969) .cse120)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse119 v_arrayElimCell_90) .cse120))))) .cse23) (or .cse10 (and (or .cse47 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse123 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse123 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse123 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (let ((.cse126 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse126 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (store (select .cse126 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968) .cse3 v_ArrVal_972)))) (.cse125 (bvadd (select (select (store .cse97 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store .cse98 .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_arrayElimCell_86) .cse125)) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse124 v_arrayElimCell_90) .cse125)))))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_18 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse127 (let ((.cse129 (let ((.cse130 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse130 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse130 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse129 v_subst_18 (store (select .cse129 v_subst_18) .cse3 v_ArrVal_972)))) (.cse128 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_18 (store (select .cse2 v_subst_18) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse127 v_arrayElimCell_86) .cse128))) (= v_subst_18 .cse4) (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse127 v_arrayElimCell_90) .cse128) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse46 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (let ((.cse84 (let ((.cse85 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse85 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse85 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse84 .cse4 (store (select .cse84 .cse4) .cse3 v_ArrVal_972)))) (.cse83 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse82 v_ArrVal_969) .cse83)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse82 v_arrayElimCell_86) .cse83)))))) (.cse33 (= .cse4 .cse9))) (and (or (and (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_26 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (let ((.cse7 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse6 v_subst_26 (store (select .cse6 v_subst_26) .cse3 v_ArrVal_972)))) (.cse1 (bvadd (select (select (store .cse2 v_subst_26 (store (select .cse2 v_subst_26) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse0 v_ArrVal_969) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 v_arrayElimCell_86) .cse1)) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_subst_28 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse13 v_subst_28 (store (select .cse13 v_subst_28) .cse3 v_ArrVal_972)))) (.cse12 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_28 (store (select .cse2 v_subst_28) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= (select (select .cse11 v_arrayElimCell_86) .cse12) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse12) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_27 (_ BitVec 32))) (or (= v_subst_27 .cse4) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse15 v_subst_27 (store (select .cse15 v_subst_27) .cse3 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_27 (store (select .cse2 v_subst_27) .cse3 v_ArrVal_966)) .cse4) .cse5)))))) (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_25 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (let ((.cse20 (let ((.cse21 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse20 v_subst_25 (store (select .cse20 v_subst_25) .cse3 v_ArrVal_972)))) (.cse19 (bvadd (select (select (store .cse2 v_subst_25 (store (select .cse2 v_subst_25) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse19)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_ArrVal_969) .cse19)))))) (or .cse10 .cse22)) .cse23) (forall ((v_subst_19 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (let ((.cse26 (let ((.cse27 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse26 v_subst_19 (store (select .cse26 v_subst_19) .cse3 v_ArrVal_972)))) (.cse25 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_19 (store (select .cse2 v_subst_19) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= (select (select .cse24 v_ArrVal_969) .cse25) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse25)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_86) .cse25))))) (= v_subst_19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (let ((.cse31 (let ((.cse32 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse31 .cse4 (store (select .cse31 .cse4) .cse3 v_ArrVal_972)))) (.cse29 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_ArrVal_969) .cse29)) (forall ((v_arrayElimCell_86 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_86) .cse29))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse29))))) (or .cse33 .cse34) (or .cse17 .cse35) (or .cse23 (and (forall ((v_subst_23 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (let ((.cse38 (let ((.cse39 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse39 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse39 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse38 v_subst_23 (store (select .cse38 v_subst_23) .cse3 v_ArrVal_972)))) (.cse37 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_23 (store (select .cse2 v_subst_23) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_ArrVal_969 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse36 v_ArrVal_969) .cse37))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse37))))) (= v_subst_23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (forall ((v_subst_24 (_ BitVec 32))) (or (= v_subst_24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= v_subst_24 .cse4) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse40 (let ((.cse41 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse41 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse41 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse40 v_subst_24 (store (select .cse40 v_subst_24) .cse3 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_24 (store (select .cse2 v_subst_24) .cse3 v_ArrVal_966)) .cse4) .cse5))))))) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_subst_22 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse43 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse42 v_subst_22 (store (select .cse42 v_subst_22) .cse3 v_ArrVal_972))) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_22 (store (select .cse2 v_subst_22) .cse3 v_ArrVal_966)) .cse4) .cse5))) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse44 .cse45) (or .cse46 .cse47) (or .cse33 .cse45) (or .cse47 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_21 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse48 (let ((.cse49 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse49 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse49 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse48 v_subst_21 (store (select .cse48 v_subst_21) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_21 (store (select .cse2 v_subst_21) .cse3 v_ArrVal_966)) .cse4) .cse5))))))) (or .cse47 (and .cse50 .cse51)) (or .cse10 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_subst_1 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse54 (let ((.cse55 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse55 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse55 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse54 v_subst_1 (store (select .cse54 v_subst_1) .cse3 v_ArrVal_972)))) (.cse53 (bvadd (select (select (store .cse2 v_subst_1 (store (select .cse2 v_subst_1) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (= v_subst_1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_86) .cse53)))))) (or .cse10 (and (or .cse47 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse56 (let ((.cse57 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse57 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse57 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse56 .cse4 (store (select .cse56 .cse4) .cse3 v_ArrVal_972))) v_arrayElimCell_86) (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))))) .cse22)) (forall ((v_subst_20 (_ BitVec 32))) (or (= v_subst_20 .cse4) (= v_subst_20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (let ((.cse60 (let ((.cse61 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse61 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse61 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse60 v_subst_20 (store (select .cse60 v_subst_20) .cse3 v_ArrVal_972)))) (.cse59 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_20 (store (select .cse2 v_subst_20) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 v_arrayElimCell_86) .cse59))))))) (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (let ((.cse64 (let ((.cse65 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse65 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse65 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse64 .cse4 (store (select .cse64 .cse4) .cse3 v_ArrVal_972)))) (.cse63 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 v_ArrVal_969) .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 v_arrayElimCell_86) .cse63))))) (or .cse33 (and (forall ((v_subst_30 (_ BitVec 32))) (or (= v_subst_30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (let ((.cse68 (let ((.cse69 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse69 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse69 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse68 v_subst_30 (store (select .cse68 v_subst_30) .cse3 v_ArrVal_972)))) (.cse67 (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_30 (store (select .cse2 v_subst_30) .cse3 v_ArrVal_966)) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= (select (select .cse66 v_arrayElimCell_90) .cse67) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 v_arrayElimCell_86) .cse67))))) (= v_subst_30 .cse4))) (or .cse23 (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_subst_29 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_subst_29 .cse4) (= v_subst_29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse70 (let ((.cse71 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse71 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse71 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse70 v_subst_29 (store (select .cse70 v_subst_29) .cse3 v_ArrVal_972))) v_arrayElimCell_90) (bvadd (_ bv8 32) (select (select (store .cse2 v_subst_29 (store (select .cse2 v_subst_29) .cse3 v_ArrVal_966)) .cse4) .cse5))))))))) (or .cse17 (forall ((v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (let ((.cse74 (let ((.cse75 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse75 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse75 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse74 .cse4 (store (select .cse74 .cse4) .cse3 v_ArrVal_972)))) (.cse73 (bvadd (_ bv8 32) (select (store .cse30 .cse3 v_ArrVal_966) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse72 v_ArrVal_969) .cse73)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse72 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse73)))))) (or .cse44 .cse34) (or .cse17 .cse46 .cse23) (or .cse17 .cse46) (or .cse33 (and (or .cse23 .cse76) (forall ((v_subst_9 (_ BitVec 32))) (or (forall ((v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_972 (_ BitVec 32)) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (let ((.cse79 (let ((.cse80 (store |c_#memory_int#1| .cse9 v_ArrVal_965))) (store .cse80 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse80 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse8 v_ArrVal_971) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_968))))) (store .cse79 v_subst_9 (store (select .cse79 v_subst_9) .cse3 v_ArrVal_972)))) (.cse78 (bvadd (select (select (store .cse2 v_subst_9 (store (select .cse2 v_subst_9) .cse3 v_ArrVal_966)) .cse4) .cse5) (_ bv8 32)))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse77 v_arrayElimCell_90) .cse78))) (= (select (select .cse77 v_arrayElimCell_86) .cse78) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= .cse4 v_subst_9))) (or .cse47 .cse50))) (or .cse81 .cse47) (or .cse17 .cse47 .cse35)))))))))) is different from true