./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:12:35,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:12:35,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:12:35,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:12:35,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:12:35,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:12:35,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:12:35,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:12:35,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:12:35,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:12:35,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:12:35,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:12:35,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:12:35,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:12:35,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:12:35,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:12:35,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:12:35,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:12:35,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:12:35,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:12:35,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:12:35,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:12:35,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:12:35,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:12:35,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:12:35,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:12:35,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:12:35,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:12:35,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:12:35,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:12:35,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:12:35,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:12:35,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:12:35,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:12:35,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:12:35,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:12:35,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:12:35,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:12:35,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:12:35,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:12:35,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:12:35,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:12:35,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:12:35,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:12:35,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:12:35,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:12:35,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:12:35,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:12:35,957 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:12:35,957 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:12:35,958 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:12:35,958 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:12:35,959 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:12:35,959 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:12:35,959 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:12:35,960 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:12:35,960 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:12:35,960 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:12:35,960 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:12:35,960 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:12:35,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:12:35,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:12:35,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:12:35,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:12:35,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:12:35,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:12:35,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:12:35,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:12:35,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:12:35,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:12:35,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:12:35,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:12:35,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:12:35,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:12:35,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:12:35,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:12:35,966 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:12:35,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:12:35,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:12:35,968 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:12:35,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:12:35,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:12:35,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:12:35,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-11-03 02:12:36,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:12:36,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:12:36,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:12:36,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:12:36,367 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:12:36,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-03 02:12:36,437 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/44c6acf38/0f75733389ed4031bb2fe49b794a3019/FLAG19be49653 [2022-11-03 02:12:37,042 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:12:37,046 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-03 02:12:37,060 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/44c6acf38/0f75733389ed4031bb2fe49b794a3019/FLAG19be49653 [2022-11-03 02:12:37,335 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/44c6acf38/0f75733389ed4031bb2fe49b794a3019 [2022-11-03 02:12:37,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:12:37,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:12:37,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:12:37,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:12:37,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:12:37,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:37,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443a34a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37, skipping insertion in model container [2022-11-03 02:12:37,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:37,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:12:37,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:12:37,824 WARN L230 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_52868d96-8098-4ded-b7fc-4544db3f9dc7/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-03 02:12:37,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:12:37,853 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:12:37,935 WARN L230 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_52868d96-8098-4ded-b7fc-4544db3f9dc7/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-03 02:12:37,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:12:37,967 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:12:37,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37 WrapperNode [2022-11-03 02:12:37,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:12:37,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:12:37,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:12:37,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:12:37,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,026 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-11-03 02:12:38,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:12:38,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:12:38,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:12:38,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:12:38,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,071 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:12:38,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:12:38,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:12:38,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:12:38,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (1/1) ... [2022-11-03 02:12:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:12:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:38,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:12:38,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:12:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:12:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:12:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 02:12:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 02:12:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:12:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:12:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:12:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:12:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:12:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:12:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:12:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:12:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:12:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:12:38,349 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:12:38,351 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:12:38,782 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:12:38,927 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:12:38,928 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 02:12:38,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:12:38 BoogieIcfgContainer [2022-11-03 02:12:38,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:12:38,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:12:38,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:12:38,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:12:38,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:12:37" (1/3) ... [2022-11-03 02:12:38,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553fdd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:12:38, skipping insertion in model container [2022-11-03 02:12:38,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:37" (2/3) ... [2022-11-03 02:12:38,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553fdd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:12:38, skipping insertion in model container [2022-11-03 02:12:38,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:12:38" (3/3) ... [2022-11-03 02:12:38,941 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-11-03 02:12:38,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:12:38,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:12:39,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:12:39,033 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@8af4f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:12:39,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:12:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:12:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:12:39,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:39,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:39,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1079724122, now seen corresponding path program 1 times [2022-11-03 02:12:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:39,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044388509] [2022-11-03 02:12:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:12:39,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:39,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044388509] [2022-11-03 02:12:39,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044388509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:12:39,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:12:39,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:12:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524320382] [2022-11-03 02:12:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:12:39,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:12:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:39,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:12:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:12:39,686 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-11-03 02:12:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:39,833 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-11-03 02:12:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:12:39,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2022-11-03 02:12:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:39,846 INFO L225 Difference]: With dead ends: 45 [2022-11-03 02:12:39,846 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:12:39,855 INFO L412 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 [2022-11-03 02:12:39,861 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:39,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:12:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:12:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-11-03 02:12:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2022-11-03 02:12:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-03 02:12:39,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2022-11-03 02:12:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:39,912 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-03 02:12:39,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-11-03 02:12:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-03 02:12:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:12:39,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:39,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:39,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:12:39,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2061360914, now seen corresponding path program 1 times [2022-11-03 02:12:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340232306] [2022-11-03 02:12:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:12:40,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:40,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340232306] [2022-11-03 02:12:40,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340232306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:12:40,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:12:40,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:12:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515042745] [2022-11-03 02:12:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:12:40,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:12:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:12:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:12:40,280 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-11-03 02:12:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:40,446 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-03 02:12:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:12:40,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22 [2022-11-03 02:12:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:40,448 INFO L225 Difference]: With dead ends: 26 [2022-11-03 02:12:40,448 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:12:40,449 INFO L412 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 [2022-11-03 02:12:40,450 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:40,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:12:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:12:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-03 02:12:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2022-11-03 02:12:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-03 02:12:40,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2022-11-03 02:12:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:40,457 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-03 02:12:40,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-11-03 02:12:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-11-03 02:12:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:12:40,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:40,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:40,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:12:40,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash 433212228, now seen corresponding path program 1 times [2022-11-03 02:12:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:40,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397705817] [2022-11-03 02:12:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:40,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:46,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:46,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397705817] [2022-11-03 02:12:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397705817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:12:46,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882527729] [2022-11-03 02:12:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:46,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:46,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:46,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:12:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-03 02:12:46,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:47,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:47,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:47,275 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:12:47,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:12:47,463 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:12:47,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:12:47,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:12:47,668 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-03 02:12:47,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-03 02:12:47,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-03 02:12:47,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 02:12:48,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 27 [2022-11-03 02:12:48,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-03 02:12:48,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:12:48,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 45 [2022-11-03 02:12:48,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,425 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 02:12:48,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:12:48,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 02:12:48,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:12:49,065 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:12:49,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 85 [2022-11-03 02:12:49,084 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:12:49,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 165 treesize of output 84 [2022-11-03 02:12:49,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 37 [2022-11-03 02:12:49,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:49,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:12:49,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-03 02:12:49,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 02:12:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:49,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 19 [2022-11-03 02:12:49,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 02:12:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:49,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:49,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))) (and (or (forall ((v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_477) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (and .cse0 .cse1)) (or (not .cse1) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse2 (= .cse5 0)) (.cse3 (= .cse4 0))) (and (or (and .cse2 .cse3) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_478 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_458) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_480) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_482) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse4)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_478) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse5)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_479) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_482) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse2) (not .cse3))))) (not .cse0)))) is different from false [2022-11-03 02:12:49,957 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0))) (and (or .cse0 (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_459)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_477) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_459)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_477) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse4 (= .cse7 0)) (.cse5 (= .cse6 0))) (and (or (and .cse4 .cse5) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_478 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_458) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_480) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_482) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse6)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_478) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse7)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_479) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_482) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse4) (not .cse5))))) (not .cse0) (not (<= 0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))) is different from false [2022-11-03 02:12:50,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (= .cse1 0)) (.cse4 (select |c_#memory_int| .cse1)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and (or (not (<= 0 .cse0)) (let ((.cse2 (= .cse0 0))) (and (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_478 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_458) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_480) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_482) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_453) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_478) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_464) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_479) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) .cse2) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_482) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_451) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_456) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse2)))) (not .cse3)) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse1 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_459)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_477) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse5 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| .cse0)))) .cse3) (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse1 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| v_ArrVal_459)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_477) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse5 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_18| .cse0))))))) is different from false [2022-11-03 02:12:51,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882527729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:12:51,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [766855661] [2022-11-03 02:12:51,631 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:12:51,631 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:51,635 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:51,641 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:51,641 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:51,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,700 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:12:51,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-03 02:12:51,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,729 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:12:51,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 02:12:51,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 9 [2022-11-03 02:12:51,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:12:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 02:12:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 02:12:51,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 02:12:51,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:12:51,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:12:51,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:12:51,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:51,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:12:52,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:52,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:52,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:52,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:52,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:52,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-11-03 02:12:52,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-11-03 02:12:52,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:52,687 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:52,690 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:52,692 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:52,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:52,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:52,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:52,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:52,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,018 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,021 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:53,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:53,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:53,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:53,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-03 02:12:53,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:53,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-03 02:12:53,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:53,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-03 02:12:53,627 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,632 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,634 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,636 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:53,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:53,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:53,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:53,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:53,980 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,984 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:53,989 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:12:54,088 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:12:54,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:12:54,121 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:12:54,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:12:54,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 11 [2022-11-03 02:12:54,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,258 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:12:54,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:12:54,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:54,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:54,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,342 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:12:54,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:12:54,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:54,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:12:54,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:12:54,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,475 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:12:54,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:12:54,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:54,507 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:12:54,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:12:54,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:54,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:54,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:58,041 INFO L356 Elim1Store]: treesize reduction 404, result has 19.7 percent of original size [2022-11-03 02:12:58,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:58,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:58,247 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_94| input size 296 context size 296 output size 296 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:12:58,252 INFO L158 Benchmark]: Toolchain (without parser) took 20912.19ms. Allocated memory was 125.8MB in the beginning and 358.6MB in the end (delta: 232.8MB). Free memory was 87.5MB in the beginning and 149.0MB in the end (delta: -61.5MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. [2022-11-03 02:12:58,253 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:12:58,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.09ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 94.7MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:12:58,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.75ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:12:58,255 INFO L158 Benchmark]: Boogie Preprocessor took 47.55ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:12:58,256 INFO L158 Benchmark]: RCFGBuilder took 854.94ms. Allocated memory is still 125.8MB. Free memory was 90.5MB in the beginning and 66.2MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-03 02:12:58,256 INFO L158 Benchmark]: TraceAbstraction took 19318.07ms. Allocated memory was 125.8MB in the beginning and 358.6MB in the end (delta: 232.8MB). Free memory was 66.0MB in the beginning and 149.0MB in the end (delta: -83.0MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB. [2022-11-03 02:12:58,258 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.09ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 94.7MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.75ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.55ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 854.94ms. Allocated memory is still 125.8MB. Free memory was 90.5MB in the beginning and 66.2MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19318.07ms. Allocated memory was 125.8MB in the beginning and 358.6MB in the end (delta: 232.8MB). Free memory was 66.0MB in the beginning and 149.0MB in the end (delta: -83.0MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_94| input size 296 context size 296 output size 296 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_94| input size 296 context size 296 output size 296: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 02:12:58,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:13:00,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:13:00,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:13:00,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:13:00,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:13:00,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:13:00,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:13:00,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:13:00,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:13:00,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:13:00,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:13:00,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:13:00,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:13:00,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:13:00,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:13:00,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:13:00,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:13:00,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:13:00,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:13:00,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:13:00,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:13:00,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:13:00,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:13:00,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:13:00,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:13:00,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:13:00,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:13:00,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:13:00,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:13:00,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:13:00,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:13:00,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:13:00,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:13:00,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:13:00,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:13:00,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:13:00,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:13:00,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:13:00,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:13:00,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:13:00,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:13:00,823 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:13:00,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:13:00,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:13:00,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:13:00,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:13:00,850 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:13:00,850 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:13:00,850 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:13:00,850 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:13:00,851 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:13:00,851 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:13:00,851 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:13:00,852 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:13:00,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:13:00,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:13:00,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:13:00,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:13:00,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:13:00,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:13:00,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:13:00,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:13:00,854 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:13:00,854 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:13:00,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:13:00,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:13:00,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:13:00,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:13:00,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:13:00,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:13:00,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:13:00,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:13:00,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:13:00,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:13:00,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:13:00,857 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:13:00,858 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:13:00,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:13:00,858 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:13:00,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:13:00,858 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-11-03 02:13:01,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:13:01,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:13:01,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:13:01,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:13:01,242 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:13:01,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-03 02:13:01,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/f72edbf41/fcdce23ce6424c43b5d9ab6d9ebd0f0b/FLAGeec73683e [2022-11-03 02:13:01,871 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:13:01,872 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-03 02:13:01,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/f72edbf41/fcdce23ce6424c43b5d9ab6d9ebd0f0b/FLAGeec73683e [2022-11-03 02:13:02,183 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/data/f72edbf41/fcdce23ce6424c43b5d9ab6d9ebd0f0b [2022-11-03 02:13:02,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:13:02,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:13:02,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:13:02,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:13:02,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:13:02,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a0b899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02, skipping insertion in model container [2022-11-03 02:13:02,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:13:02,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:13:02,718 WARN L230 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_52868d96-8098-4ded-b7fc-4544db3f9dc7/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-03 02:13:02,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:13:02,746 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:13:02,811 WARN L230 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_52868d96-8098-4ded-b7fc-4544db3f9dc7/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-03 02:13:02,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:13:02,853 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:13:02,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02 WrapperNode [2022-11-03 02:13:02,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:13:02,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:13:02,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:13:02,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:13:02,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,931 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-11-03 02:13:02,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:13:02,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:13:02,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:13:02,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:13:02,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:02,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:03,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:03,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:13:03,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:13:03,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:13:03,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:13:03,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (1/1) ... [2022-11-03 02:13:03,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:13:03,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:03,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:13:03,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:13:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:13:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 02:13:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 02:13:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:13:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:13:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:13:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:13:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:13:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:13:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:13:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:13:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:13:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:13:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:13:03,311 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:13:03,313 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:13:03,898 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:13:03,910 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:13:03,910 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 02:13:03,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:13:03 BoogieIcfgContainer [2022-11-03 02:13:03,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:13:03,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:13:03,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:13:03,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:13:03,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:13:02" (1/3) ... [2022-11-03 02:13:03,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3961f8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:13:03, skipping insertion in model container [2022-11-03 02:13:03,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:02" (2/3) ... [2022-11-03 02:13:03,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3961f8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:13:03, skipping insertion in model container [2022-11-03 02:13:03,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:13:03" (3/3) ... [2022-11-03 02:13:03,939 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-11-03 02:13:03,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:13:03,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:13:04,027 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:13:04,032 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@63ac48c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:13:04,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:13:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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) [2022-11-03 02:13:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:13:04,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:04,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:04,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2022-11-03 02:13:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:13:04,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872093637] [2022-11-03 02:13:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:13:04,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:13:04,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:13:04,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:13:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:04,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:13:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:13:04,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:04,374 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:13:04,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872093637] [2022-11-03 02:13:04,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872093637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:04,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:04,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:13:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775726885] [2022-11-03 02:13:04,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:04,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:13:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:13:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:13:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:13:04,411 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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), 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) [2022-11-03 02:13:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:04,433 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-11-03 02:13:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:13:04,436 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), 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 [2022-11-03 02:13:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:04,443 INFO L225 Difference]: With dead ends: 65 [2022-11-03 02:13:04,444 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 02:13:04,447 INFO L412 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 [2022-11-03 02:13:04,451 INFO L413 NwaCegarLoop]: 46 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, 46 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 [2022-11-03 02:13:04,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 02:13:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-03 02:13:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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) [2022-11-03 02:13:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-11-03 02:13:04,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-11-03 02:13:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:04,489 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-11-03 02:13:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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) [2022-11-03 02:13:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-11-03 02:13:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:13:04,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:04,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:04,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 02:13:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:13:04,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2022-11-03 02:13:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:13:04,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350017113] [2022-11-03 02:13:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:13:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:13:04,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:13:04,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:13:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:04,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:13:04,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:04,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:04,961 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:13:04,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350017113] [2022-11-03 02:13:04,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350017113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:04,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:04,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506637113] [2022-11-03 02:13:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:13:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:04,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:04,966 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2022-11-03 02:13:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:04,992 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-11-03 02:13:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:04,993 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), 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 [2022-11-03 02:13:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:04,994 INFO L225 Difference]: With dead ends: 52 [2022-11-03 02:13:04,996 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 02:13:04,996 INFO L412 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 [2022-11-03 02:13:04,997 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:04,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 02:13:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-03 02:13:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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) [2022-11-03 02:13:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-03 02:13:05,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2022-11-03 02:13:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:05,006 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-03 02:13:05,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2022-11-03 02:13:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-03 02:13:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:13:05,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:05,008 INFO L195 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] [2022-11-03 02:13:05,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:05,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:13:05,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2022-11-03 02:13:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:13:05,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108962944] [2022-11-03 02:13:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:05,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:13:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:13:05,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:13:05,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:13:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:13:05,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:13:05,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:05,489 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:13:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108962944] [2022-11-03 02:13:05,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108962944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:05,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:05,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:13:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242802169] [2022-11-03 02:13:05,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:05,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:13:05,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:13:05,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:13:05,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:13:05,493 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-11-03 02:13:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:05,553 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-11-03 02:13:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:13:05,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 33 [2022-11-03 02:13:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:05,555 INFO L225 Difference]: With dead ends: 41 [2022-11-03 02:13:05,556 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 02:13:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:13:05,557 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:05,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 02:13:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-03 02:13:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:13:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-11-03 02:13:05,566 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 33 [2022-11-03 02:13:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:05,567 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-11-03 02:13:05,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-11-03 02:13:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-11-03 02:13:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:13:05,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:05,569 INFO L195 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] [2022-11-03 02:13:05,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:05,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:13:05,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2022-11-03 02:13:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:13:05,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7818128] [2022-11-03 02:13:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:05,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:13:05,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:13:05,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:13:05,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:13:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:06,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-03 02:13:06,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:06,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:06,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:06,914 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:13:06,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:07,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:13:07,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:07,309 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:13:07,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 39 [2022-11-03 02:13:07,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:13:07,641 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:13:07,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 33 [2022-11-03 02:13:07,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:13:07,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:07,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:13:08,141 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-03 02:13:08,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 68 [2022-11-03 02:13:08,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:13:08,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 [2022-11-03 02:13:08,230 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-03 02:13:08,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-03 02:13:08,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:13:08,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 26 [2022-11-03 02:13:08,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 65 [2022-11-03 02:13:09,367 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:13:09,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 83 [2022-11-03 02:13:09,484 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:13:09,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 116 [2022-11-03 02:13:09,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-03 02:13:09,538 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-03 02:13:09,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 80 [2022-11-03 02:13:09,574 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:13:09,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 36 [2022-11-03 02:13:09,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:09,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 [2022-11-03 02:13:09,841 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:13:09,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2022-11-03 02:13:09,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:13:09,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:10,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:10,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_254 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_254)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_251) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:13:10,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_254 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_254)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_251) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:13:10,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_254 (_ BitVec 32))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_254)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_251) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 02:13:11,324 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:13:11,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7818128] [2022-11-03 02:13:11,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7818128] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:11,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1873868053] [2022-11-03 02:13:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:11,325 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:13:11,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:13:11,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:13:11,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-03 02:13:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:11,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 02:13:11,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:11,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:12,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:12,542 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:13:12,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:12,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:13:13,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:13:13,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:13,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:13:13,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:13,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:13:14,134 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:13:14,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-11-03 02:13:14,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:14,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:14,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 40 [2022-11-03 02:13:14,216 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 02:13:14,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:14,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:13:15,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:15,207 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-03 02:13:15,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 74 [2022-11-03 02:13:15,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-11-03 02:13:15,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:15,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:15,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 25 [2022-11-03 02:13:15,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:13:15,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 18 [2022-11-03 02:13:15,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:15,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:13:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:15,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:15,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_344)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_346) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 02:13:15,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_344)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_346) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_348) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_343) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:13:15,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_344)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_346) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_348) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_343) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 02:13:16,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1873868053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:16,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542667845] [2022-11-03 02:13:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:16,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:17,000 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:17,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:13:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:17,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-03 02:13:17,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:17,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:17,772 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:13:17,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:13:18,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:18,541 INFO L356 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-03 02:13:18,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 02:13:18,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:13:19,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:13:26,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,529 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:13:26,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 25 [2022-11-03 02:13:26,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 40 [2022-11-03 02:13:26,611 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 02:13:26,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:13:26,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:13:27,795 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-03 02:13:27,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 97 [2022-11-03 02:13:27,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-03 02:13:27,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-03 02:13:27,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:13:27,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-03 02:13:28,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 19 [2022-11-03 02:13:28,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:13:28,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:13:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:13:28,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:32,959 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_447 (_ BitVec 32)) (v_ArrVal_464 (_ BitVec 32)) (v_ArrVal_463 (_ BitVec 32)) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_463)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse0 (_ bv0 32)) (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_464)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_465))) (store .cse1 .cse0 (store (select .cse1 .cse0) .cse2 v_ArrVal_447))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_448) (select (select (store (store .cse3 .cse0 v_ArrVal_442) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_450) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_447 (_ BitVec 32)) (v_ArrVal_464 (_ BitVec 32)) (v_ArrVal_463 (_ BitVec 32)) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_464)))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse5 (_ bv0 32)) (= (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_463)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_465))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse5 v_ArrVal_447))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_448) (select (select (store (store .cse8 .cse7 v_ArrVal_442) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_450) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store .cse9 .cse7 (store (select .cse9 .cse7) .cse5 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_14| v_ArrVal_446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)))))))) is different from false [2022-11-03 02:13:33,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542667845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:33,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:13:33,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 58 [2022-11-03 02:13:33,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430366752] [2022-11-03 02:13:33,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:33,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-03 02:13:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:13:33,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-03 02:13:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3936, Unknown=19, NotChecked=924, Total=5112 [2022-11-03 02:13:33,078 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:13:42,930 WARN L234 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 70 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:13:54,825 WARN L234 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 51 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:13:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:57,289 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-11-03 02:13:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:13:57,290 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 34 [2022-11-03 02:13:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:57,293 INFO L225 Difference]: With dead ends: 52 [2022-11-03 02:13:57,293 INFO L226 Difference]: Without dead ends: 50 [2022-11-03 02:13:57,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=369, Invalid=6120, Unknown=19, NotChecked=1148, Total=7656 [2022-11-03 02:13:57,297 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:57,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 497 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 572 Invalid, 0 Unknown, 249 Unchecked, 2.6s Time] [2022-11-03 02:13:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-03 02:13:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-11-03 02:13:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:13:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-11-03 02:13:57,313 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 34 [2022-11-03 02:13:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:57,313 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-11-03 02:13:57,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:13:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-11-03 02:13:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:13:57,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:57,315 INFO L195 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] [2022-11-03 02:13:57,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-03 02:13:57,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-11-03 02:13:57,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:57,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:57,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2022-11-03 02:13:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:13:57,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563763980] [2022-11-03 02:13:57,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:13:57,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:13:57,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:13:57,933 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:13:57,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:13:58,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:13:58,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:58,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:13:58,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:13:58,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:13:58,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:13:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563763980] [2022-11-03 02:13:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563763980] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [594693195] [2022-11-03 02:13:58,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:13:58,846 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:13:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:13:58,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:13:58,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-03 02:13:59,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:13:59,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:59,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:13:59,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:13:59,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:13:59,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [594693195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:59,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090247440] [2022-11-03 02:13:59,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:13:59,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:59,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:59,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:59,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:13:59,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:13:59,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:59,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:13:59,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:13:59,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:14:00,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090247440] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:00,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:14:00,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6, 6] total 10 [2022-11-03 02:14:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157871481] [2022-11-03 02:14:00,678 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:00,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:14:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:14:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:14:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:14:00,686 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:14:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:00,843 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-11-03 02:14:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 35 [2022-11-03 02:14:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:00,846 INFO L225 Difference]: With dead ends: 61 [2022-11-03 02:14:00,846 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 02:14:00,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:14:00,847 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:00,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 113 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 02:14:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-03 02:14:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:14:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-11-03 02:14:00,862 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 35 [2022-11-03 02:14:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:00,863 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-11-03 02:14:00,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-03 02:14:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-11-03 02:14:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:14:00,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:00,864 INFO L195 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] [2022-11-03 02:14:00,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:01,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:01,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-03 02:14:01,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:14:01,469 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2022-11-03 02:14:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:14:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816440610] [2022-11-03 02:14:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:14:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:14:01,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:14:01,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:14:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:01,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:14:01,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:01,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:01,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:01,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:01,941 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:14:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816440610] [2022-11-03 02:14:01,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816440610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:01,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [66447433] [2022-11-03 02:14:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:14:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:14:01,947 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:14:01,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-03 02:14:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:02,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:14:02,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:02,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:02,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:02,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:02,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [66447433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757534557] [2022-11-03 02:14:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:02,410 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:02,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:14:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:02,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:14:02,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:02,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:02,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:02,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:02,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757534557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:02,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:14:02,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 7 [2022-11-03 02:14:02,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170111295] [2022-11-03 02:14:02,749 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:02,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:14:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:14:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:14:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:02,750 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-11-03 02:14:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:03,162 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-11-03 02:14:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:03,165 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), 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 36 [2022-11-03 02:14:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:03,166 INFO L225 Difference]: With dead ends: 66 [2022-11-03 02:14:03,166 INFO L226 Difference]: Without dead ends: 57 [2022-11-03 02:14:03,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:14:03,167 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:03,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:14:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-03 02:14:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-11-03 02:14:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:14:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-11-03 02:14:03,183 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 36 [2022-11-03 02:14:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:03,183 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-11-03 02:14:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-11-03 02:14:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-11-03 02:14:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:14:03,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:03,185 INFO L195 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] [2022-11-03 02:14:03,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:03,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:03,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:03,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:14:03,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:03,806 INFO L85 PathProgramCache]: Analyzing trace with hash -268258536, now seen corresponding path program 1 times [2022-11-03 02:14:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:14:03,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327244029] [2022-11-03 02:14:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:14:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:14:03,808 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:14:03,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 02:14:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:04,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:14:04,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:04,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 02:14:04,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-11-03 02:14:04,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:04,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:14:04,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:14:04,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:04,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:14:04,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327244029] [2022-11-03 02:14:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327244029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:04,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949082651] [2022-11-03 02:14:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:04,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:14:04,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:14:04,904 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:14:04,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-03 02:14:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:05,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:14:05,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:05,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:06,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:14:06,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:06,386 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:14:06,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 28 [2022-11-03 02:14:06,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:06,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:06,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 02:14:06,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:06,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:14:06,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:06,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [949082651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:06,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:06,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 25 [2022-11-03 02:14:06,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074801644] [2022-11-03 02:14:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:06,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:14:06,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:14:06,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:14:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=616, Unknown=11, NotChecked=0, Total=702 [2022-11-03 02:14:06,842 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:14:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:07,401 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-03 02:14:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:14:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-11-03 02:14:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:07,405 INFO L225 Difference]: With dead ends: 54 [2022-11-03 02:14:07,405 INFO L226 Difference]: Without dead ends: 52 [2022-11-03 02:14:07,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=91, Invalid=767, Unknown=12, NotChecked=0, Total=870 [2022-11-03 02:14:07,407 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:07,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-11-03 02:14:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-03 02:14:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-11-03 02:14:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:14:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-11-03 02:14:07,430 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 36 [2022-11-03 02:14:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:07,431 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-11-03 02:14:07,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:14:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-11-03 02:14:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:14:07,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:07,433 INFO L195 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] [2022-11-03 02:14:07,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:07,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:07,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:14:07,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2022-11-03 02:14:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:14:07,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219328287] [2022-11-03 02:14:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:07,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:14:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:14:07,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:14:07,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 02:14:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:08,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 02:14:08,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:08,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:08,583 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:14:08,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:08,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:08,875 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:14:08,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 31 [2022-11-03 02:14:09,127 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:14:09,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 26 [2022-11-03 02:14:09,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:14:09,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:14:09,520 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-03 02:14:09,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 59 [2022-11-03 02:14:09,561 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:14:09,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 [2022-11-03 02:14:09,605 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-03 02:14:09,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-03 02:14:09,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 25 [2022-11-03 02:14:09,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 66 [2022-11-03 02:14:10,491 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:14:10,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 58 [2022-11-03 02:14:10,571 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:14:10,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 79 [2022-11-03 02:14:10,601 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-03 02:14:10,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 66 [2022-11-03 02:14:10,635 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:14:10,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 36 [2022-11-03 02:14:10,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:10,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:11,168 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:14:11,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-11-03 02:14:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:14:11,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:11,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_1157 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1155))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-03 02:14:11,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_1157 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1155))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 02:14:11,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_1157 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1155))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1157) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-03 02:14:12,470 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:14:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219328287] [2022-11-03 02:14:12,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219328287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957665447] [2022-11-03 02:14:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:12,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:14:12,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:14:12,473 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:14:12,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-03 02:14:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:12,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:14:12,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:13,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:13,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-03 02:14:14,263 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:14:14,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 24 [2022-11-03 02:14:14,283 INFO L356 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-11-03 02:14:14,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 02:14:14,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:15,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:15,224 INFO L356 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2022-11-03 02:14:15,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 137 treesize of output 112 [2022-11-03 02:14:15,287 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:14:15,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 74 [2022-11-03 02:14:15,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:15,317 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:14:15,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2022-11-03 02:14:15,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2022-11-03 02:14:15,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:15,359 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:14:15,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 91 [2022-11-03 02:14:15,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 13 [2022-11-03 02:14:15,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:15,436 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:14:15,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 43 treesize of output 34 [2022-11-03 02:14:15,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-03 02:14:15,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-11-03 02:14:15,597 INFO L356 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2022-11-03 02:14:15,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 83 [2022-11-03 02:14:16,211 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 02:14:16,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 67 [2022-11-03 02:14:17,061 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-11-03 02:14:17,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 51 [2022-11-03 02:14:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:14:19,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:20,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-03 02:14:20,278 INFO L356 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2022-11-03 02:14:20,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 179 [2022-11-03 02:14:20,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:14:20,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 317 treesize of output 342 [2022-11-03 02:14:20,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 278 treesize of output 276 [2022-11-03 02:14:23,347 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse11 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (let ((.cse14 (not .cse11)) (.cse30 (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse31 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (or .cse14 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse43 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse31)))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse42 (select (select .cse43 .cse42) v_arrayElimCell_151)))))))) (.cse18 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse41 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse40 (select (select .cse41 .cse40) v_arrayElimCell_151)))))) .cse14)) (.cse6 (or .cse14 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (or (not (let ((.cse39 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse38 (select (select .cse39 .cse38) v_arrayElimCell_151))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24)))))) (let ((.cse1 (and .cse6 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32))) (or (not (let ((.cse37 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse36 (select (select .cse37 .cse36) v_arrayElimCell_148))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) .cse11))) (.cse2 (and .cse18 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32))) (not (let ((.cse34 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse34 .cse35) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|) .cse35))))) .cse11))) (.cse5 (and .cse27 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32))) (not (let ((.cse32 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse31)))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse32 .cse33) v_arrayElimCell_148) .cse33))))) .cse11))) (.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse23 (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse24 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) (.cse4 (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse9)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 .cse5 .cse3) .cse6 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32))) (or (not (let ((.cse8 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse7 (select (select .cse8 .cse7) v_arrayElimIndex_24))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) .cse11) (or .cse1 .cse3) (or .cse2 .cse0) (or (let ((.cse17 (and .cse18 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32))) (not (let ((.cse20 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse19 (select (select .cse20 .cse19) v_arrayElimCell_148)))))) .cse11)))) (and (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimCell_148 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimCell_148))))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse12 (select (select .cse13 .cse12) v_arrayElimCell_151)))))) .cse14) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32))) (not (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimCell_148 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimCell_148))))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse15 .cse16) v_arrayElimCell_148) .cse16))))) .cse11) (or .cse4 .cse5) (or .cse17 .cse3) (or .cse17 .cse0))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse9)) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse22 (store .cse23 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse24)))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse21 (select (select .cse22 .cse21) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))) .cse11) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse25 (store .cse23 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse24)))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse25 .cse26) v_arrayElimCell_151) .cse26))))) .cse14) (or .cse4 (and .cse27 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse28 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse31)))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse28 .cse29) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|) .cse29))))) .cse11))))))))) is different from false [2022-11-03 02:14:25,359 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse11 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (let ((.cse14 (not .cse11)) (.cse30 (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse31 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (or .cse14 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse43 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse31)))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse42 (select (select .cse43 .cse42) v_arrayElimCell_151)))))))) (.cse18 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse41 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse40 (select (select .cse41 .cse40) v_arrayElimCell_151)))))) .cse14)) (.cse6 (or .cse14 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (or (not (let ((.cse39 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse38 (select (select .cse39 .cse38) v_arrayElimCell_151))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24)))))) (let ((.cse1 (and .cse6 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32))) (or (not (let ((.cse37 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse36 (select (select .cse37 .cse36) v_arrayElimCell_148))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) .cse11))) (.cse2 (and .cse18 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32))) (not (let ((.cse34 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse34 .cse35) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|) .cse35))))) .cse11))) (.cse5 (and .cse27 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32))) (not (let ((.cse32 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse31)))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse32 .cse33) v_arrayElimCell_148) .cse33))))) .cse11))) (.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse23 (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse24 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) (.cse4 (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse9)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 .cse5 .cse3) .cse6 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32))) (or (not (let ((.cse8 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse7 (select (select .cse8 .cse7) v_arrayElimIndex_24))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) .cse11) (or .cse1 .cse3) (or .cse2 .cse0) (or (let ((.cse17 (and .cse18 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32))) (not (let ((.cse20 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimIndex_24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimIndex_24))))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse19 (select (select .cse20 .cse19) v_arrayElimCell_148)))))) .cse11)))) (and (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimCell_148 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimCell_148))))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse12 (select (select .cse13 .cse12) v_arrayElimCell_151)))))) .cse14) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32))) (not (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 v_arrayElimCell_148 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse10 v_arrayElimCell_148))))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse15 .cse16) v_arrayElimCell_148) .cse16))))) .cse11) (or .cse4 .cse5) (or .cse17 .cse3) (or .cse17 .cse0))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse9)) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse22 (store .cse23 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse24)))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse21 (select (select .cse22 .cse21) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))) .cse11) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (not (let ((.cse25 (store .cse23 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse24)))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse25 .cse26) v_arrayElimCell_151) .cse26))))) .cse14) (or .cse4 (and .cse27 (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse28 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse31)))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse28 .cse29) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|) .cse29))))) .cse11))))))))) is different from true [2022-11-03 02:14:29,266 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 1)))) (.cse24 (not (bvult |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|)))) (let ((.cse47 (or .cse23 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse86 (select (select .cse85 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse87 (select .cse85 .cse86))) (let ((.cse88 (store (select (store .cse85 .cse86 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse87 v_arrayElimIndex_24)))) (let ((.cse84 (select .cse88 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse84 (select (select (store (store .cse85 .cse86 (store .cse87 v_arrayElimIndex_24 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse88) .cse84) v_arrayElimCell_151)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) .cse24))) (let ((.cse10 (and (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse76 (select (select .cse75 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse77 (select .cse75 .cse76))) (let ((.cse78 (store (select (store .cse75 .cse76 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse77 v_arrayElimIndex_24)))) (let ((.cse74 (select .cse78 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse74 (select (select (store (store .cse75 .cse76 (store .cse77 v_arrayElimIndex_24 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse78) .cse74) v_arrayElimCell_151)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse79 (let ((.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse83 (select .cse81 .cse82))) (store (store .cse81 .cse82 (store .cse83 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse81 .cse82 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse83 v_arrayElimIndex_24)))))))) (let ((.cse80 (select (select .cse79 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse79 .cse80) (_ bv0 32)) .cse80))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))))) (.cse12 (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse71 (select (select .cse70 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse72 (select .cse70 .cse71))) (let ((.cse73 (store (select (store .cse70 .cse71 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse72 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse69 (select .cse73 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse69 (select (select (store (store .cse70 .cse71 (store .cse72 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse73) .cse69) v_arrayElimCell_151)))))) (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse71)))))))) (.cse36 (and .cse47 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse67 (select (select .cse66 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse68 (select .cse66 .cse67))) (store (store .cse66 .cse67 (store .cse68 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse66 .cse67 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse68 v_arrayElimIndex_24)))))))) (let ((.cse64 (select (select .cse65 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse64 (select (select .cse65 .cse64) v_arrayElimCell_148))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))))) (.cse30 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse48 (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse54 (select (select .cse57 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse54) (not (let ((.cse56 (let ((.cse58 (select .cse57 .cse54))) (store (store .cse57 .cse54 (store .cse58 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse57 .cse54 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse58 v_arrayElimIndex_24)))))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse55 (select (select .cse56 .cse55) v_arrayElimCell_148))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse59 (select (select .cse61 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse59) (not (let ((.cse62 (select .cse61 .cse59))) (let ((.cse63 (store (select (store .cse61 .cse59 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse62 v_arrayElimIndex_24)))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse60 (select (select (store (store .cse61 .cse59 (store .cse62 v_arrayElimIndex_24 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse63) .cse60) v_arrayElimCell_151)))))))))))))) (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (let ((.cse1 (let ((.cse4 (select .cse3 .cse0))) (store (store .cse3 .cse0 (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse3 .cse0 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse1 .cse2) (_ bv0 32)) .cse2)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse5) (not (let ((.cse7 (let ((.cse9 (select .cse8 .cse5))) (store (store .cse8 .cse5 (store .cse9 v_arrayElimCell_148 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse8 .cse5 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse9 v_arrayElimCell_148)))))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse6 (select (select .cse7 .cse6) v_arrayElimCell_148))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or .cse10 .cse11) .cse12 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse13) (not (let ((.cse14 (let ((.cse17 (select .cse16 .cse13))) (store (store .cse16 .cse13 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse16 .cse13 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse14 .cse15) v_arrayElimCell_148) .cse15)))) (not (= .cse13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse18) (not (let ((.cse21 (select .cse20 .cse18))) (let ((.cse22 (store (select (store .cse20 .cse18 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse19 (select (select (store (store .cse20 .cse18 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse22) .cse19) v_arrayElimCell_151)))))) (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse18)))))) .cse23 .cse24) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse28 (select .cse26 .cse27))) (let ((.cse29 (store (select (store .cse26 .cse27 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse28 (_ bv0 32))))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse25 (select (select (store (store .cse26 .cse27 (store .cse28 (_ bv0 32) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse29) .cse25) v_arrayElimCell_151))))))))) .cse23 .cse24) (or .cse10 .cse30) (or (and .cse12 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse31 (let ((.cse35 (select .cse33 .cse34))) (store (store .cse33 .cse34 (store .cse35 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse33 .cse34 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse35 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse31 .cse32) v_arrayElimCell_148) .cse32)))) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|))))) .cse30) (or .cse11 .cse36) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse37 (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse41 (select .cse39 .cse40))) (store (store .cse39 .cse40 (store .cse41 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse39 .cse40 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse41 v_arrayElimIndex_24)))))))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse37 .cse38) v_arrayElimIndex_24) .cse38)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))))) (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse42) (not (let ((.cse44 (select .cse43 .cse42))) (let ((.cse45 (store (select (store .cse43 .cse42 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse44 v_arrayElimCell_148)))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store .cse43 .cse42 (store .cse44 v_arrayElimCell_148 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse45) .cse46) v_arrayElimCell_151) .cse46)))))))))) .cse47 (or .cse36 .cse30) (or .cse30 .cse48) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse49 (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse52 (select (select .cse51 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse53 (select .cse51 .cse52))) (store (store .cse51 .cse52 (store .cse53 (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse51 .cse52 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse53 (_ bv0 32))))))))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse49 .cse50) (_ bv0 32)) .cse50))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or .cse11 .cse48))))) is different from false [2022-11-03 02:14:31,307 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse23 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 1)))) (.cse24 (not (bvult |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|)))) (let ((.cse47 (or .cse23 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse86 (select (select .cse85 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse87 (select .cse85 .cse86))) (let ((.cse88 (store (select (store .cse85 .cse86 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse87 v_arrayElimIndex_24)))) (let ((.cse84 (select .cse88 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse84 (select (select (store (store .cse85 .cse86 (store .cse87 v_arrayElimIndex_24 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse88) .cse84) v_arrayElimCell_151)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) .cse24))) (let ((.cse10 (and (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse76 (select (select .cse75 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse77 (select .cse75 .cse76))) (let ((.cse78 (store (select (store .cse75 .cse76 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse77 v_arrayElimIndex_24)))) (let ((.cse74 (select .cse78 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse74 (select (select (store (store .cse75 .cse76 (store .cse77 v_arrayElimIndex_24 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse78) .cse74) v_arrayElimCell_151)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse79 (let ((.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse83 (select .cse81 .cse82))) (store (store .cse81 .cse82 (store .cse83 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse81 .cse82 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse83 v_arrayElimIndex_24)))))))) (let ((.cse80 (select (select .cse79 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse79 .cse80) (_ bv0 32)) .cse80))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))))) (.cse12 (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse71 (select (select .cse70 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse72 (select .cse70 .cse71))) (let ((.cse73 (store (select (store .cse70 .cse71 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse72 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse69 (select .cse73 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse69 (select (select (store (store .cse70 .cse71 (store .cse72 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse73) .cse69) v_arrayElimCell_151)))))) (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse71)))))))) (.cse36 (and .cse47 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse67 (select (select .cse66 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse68 (select .cse66 .cse67))) (store (store .cse66 .cse67 (store .cse68 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse66 .cse67 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse68 v_arrayElimIndex_24)))))))) (let ((.cse64 (select (select .cse65 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse64 (select (select .cse65 .cse64) v_arrayElimCell_148))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))))) (.cse30 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse48 (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse54 (select (select .cse57 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse54) (not (let ((.cse56 (let ((.cse58 (select .cse57 .cse54))) (store (store .cse57 .cse54 (store .cse58 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse57 .cse54 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse58 v_arrayElimIndex_24)))))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse55 (select (select .cse56 .cse55) v_arrayElimCell_148))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse59 (select (select .cse61 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse59) (not (let ((.cse62 (select .cse61 .cse59))) (let ((.cse63 (store (select (store .cse61 .cse59 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse62 v_arrayElimIndex_24)))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse60 (select (select (store (store .cse61 .cse59 (store .cse62 v_arrayElimIndex_24 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse63) .cse60) v_arrayElimCell_151)))))))))))))) (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (let ((.cse1 (let ((.cse4 (select .cse3 .cse0))) (store (store .cse3 .cse0 (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse3 .cse0 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse1 .cse2) (_ bv0 32)) .cse2)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse5) (not (let ((.cse7 (let ((.cse9 (select .cse8 .cse5))) (store (store .cse8 .cse5 (store .cse9 v_arrayElimCell_148 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse8 .cse5 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse9 v_arrayElimCell_148)))))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse6 (select (select .cse7 .cse6) v_arrayElimCell_148))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or .cse10 .cse11) .cse12 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse13) (not (let ((.cse14 (let ((.cse17 (select .cse16 .cse13))) (store (store .cse16 .cse13 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse16 .cse13 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse14 .cse15) v_arrayElimCell_148) .cse15)))) (not (= .cse13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse18) (not (let ((.cse21 (select .cse20 .cse18))) (let ((.cse22 (store (select (store .cse20 .cse18 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse19 (select (select (store (store .cse20 .cse18 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse22) .cse19) v_arrayElimCell_151)))))) (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse18)))))) .cse23 .cse24) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse28 (select .cse26 .cse27))) (let ((.cse29 (store (select (store .cse26 .cse27 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse28 (_ bv0 32))))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse25 (select (select (store (store .cse26 .cse27 (store .cse28 (_ bv0 32) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse29) .cse25) v_arrayElimCell_151))))))))) .cse23 .cse24) (or .cse10 .cse30) (or (and .cse12 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse31 (let ((.cse35 (select .cse33 .cse34))) (store (store .cse33 .cse34 (store .cse35 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse33 .cse34 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse35 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse31 .cse32) v_arrayElimCell_148) .cse32)))) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|))))) .cse30) (or .cse11 .cse36) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_24 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse37 (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse41 (select .cse39 .cse40))) (store (store .cse39 .cse40 (store .cse41 v_arrayElimIndex_24 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse39 .cse40 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse41 v_arrayElimIndex_24)))))))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse37 .cse38) v_arrayElimIndex_24) .cse38)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_24))))) (or .cse23 .cse24 (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_148 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1246))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse42) (not (let ((.cse44 (select .cse43 .cse42))) (let ((.cse45 (store (select (store .cse43 .cse42 v_ArrVal_1240) |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (select .cse44 v_arrayElimCell_148)))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store .cse43 .cse42 (store .cse44 v_arrayElimCell_148 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| .cse45) .cse46) v_arrayElimCell_151) .cse46)))))))))) .cse47 (or .cse36 .cse30) (or .cse30 .cse48) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse49 (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| v_ArrVal_1246))) (let ((.cse52 (select (select .cse51 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse53 (select .cse51 .cse52))) (store (store .cse51 .cse52 (store .cse53 (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| (store (select (store .cse51 .cse52 v_ArrVal_1240) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (_ bv0 32) (select .cse53 (_ bv0 32))))))))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse49 .cse50) (_ bv0 32)) .cse50))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35|))) (not (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_35| |c_#StackHeapBarrier|)))) (or .cse11 .cse48))))) is different from true [2022-11-03 02:14:31,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [957665447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:31,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774961483] [2022-11-03 02:14:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:31,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:31,323 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:31,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:14:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:31,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 02:14:31,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:31,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:32,437 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:14:32,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:14:33,458 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:14:33,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:14:46,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:46,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:46,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 33 [2022-11-03 02:14:46,192 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 02:14:46,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:14:46,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-11-03 02:14:47,703 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-03 02:14:47,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 68 [2022-11-03 02:14:47,798 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 02:14:47,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 118 [2022-11-03 02:14:47,889 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 02:14:47,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 114 treesize of output 99 [2022-11-03 02:14:48,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 57 [2022-11-03 02:14:49,408 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-03 02:14:49,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 60 [2022-11-03 02:14:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:14:49,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:52,734 INFO L356 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2022-11-03 02:14:52,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 1115 treesize of output 1089 [2022-11-03 02:14:54,328 INFO L356 Elim1Store]: treesize reduction 11, result has 80.4 percent of original size [2022-11-03 02:14:54,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3791 treesize of output 3711 [2022-11-03 02:14:54,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3598 treesize of output 3582 [2022-11-03 02:14:54,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3582 treesize of output 3574 [2022-11-03 02:16:20,607 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse151 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv0 32))) (.cse42 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 32) (_ bv0 32)))) (let ((.cse35 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse687 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse686 (select .cse687 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse683 (store (let ((.cse685 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse687))) (store .cse685 .cse686 (store (select .cse685 .cse686) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse684 (select (select .cse683 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse683 .cse684) v_arrayElimCell_176) .cse684))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse686)))))) (= v_arrayElimCell_170 (_ bv0 32))))) (.cse36 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse682 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse681 (select .cse682 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse678 (store (let ((.cse680 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse682))) (store .cse680 .cse681 (store (select .cse680 .cse681) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse679 (select (select .cse678 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse678 .cse679) v_arrayElimCell_176) .cse679))))) (= .cse681 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse681))))))) (.cse51 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse677 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse674 (select (select .cse677 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse674) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse675 (store (store .cse677 .cse674 (store (select .cse677 .cse674) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse676 (select (select .cse675 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse675 .cse676) v_arrayElimCell_171) .cse676))))) (= .cse674 (_ bv0 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse1 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse672 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse673 (select (select .cse672 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse670 (store (store .cse672 .cse673 (store (select .cse672 .cse673) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse671 (select (select .cse670 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse670 .cse671) v_arrayElimCell_176) .cse671))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse673)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse56 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse669 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse666 (select (select .cse669 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse666 (_ bv0 32)) (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse667 (store (store .cse669 .cse666 (store (select .cse669 .cse666) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse668 (select (select .cse667 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse667 .cse668) v_arrayElimCell_176) .cse668))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse666))))))))) (.cse57 (or .cse151 (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse660 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse661 (select (select .cse660 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse658 (store (store .cse660 .cse661 (store (select .cse660 .cse661) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse659 (select (select .cse658 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse658 .cse659) v_arrayElimCell_176) .cse659))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse661)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse665 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse662 (select (select .cse665 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse662) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse663 (store (store .cse665 .cse662 (store (select .cse665 .cse662) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse664 (select (select .cse663 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse663 .cse664) v_arrayElimCell_171) .cse664))))))))) (= v_arrayElimCell_170 (_ bv0 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse4 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse657 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse654 (select (select .cse657 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse654) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse655 (store (store .cse657 .cse654 (store (select .cse657 .cse654) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse656 (select (select .cse655 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse655 .cse656) v_arrayElimCell_171) .cse656))))))))) (= v_arrayElimCell_170 (_ bv0 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse59 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| (_ bv4 32))) (.cse288 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse653 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse652 (select .cse653 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse650 (store (let ((.cse651 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse653))) (store .cse651 .cse652 (store (select .cse651 .cse652) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse649 (select (select .cse650 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse649 (select (select .cse650 .cse649) v_arrayElimCell_174))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse652) (= .cse652 (_ bv0 32))))))) (.cse289 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse648 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse647 (select .cse648 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse645 (store (let ((.cse646 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse648))) (store .cse646 .cse647 (store (select .cse646 .cse647) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse644 (select (select .cse645 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse644 (select (select .cse645 .cse644) v_arrayElimCell_176))))) (= .cse647 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse647))))))) (.cse290 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse643 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse642 (select .cse643 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse640 (store (let ((.cse641 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse643))) (store .cse641 .cse642 (store (select .cse641 .cse642) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse639 (select (select .cse640 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse639 (select (select .cse640 .cse639) v_arrayElimCell_174))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse642))))) (= v_arrayElimCell_174 (_ bv0 32))))) (.cse291 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse638 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse637 (select .cse638 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse635 (store (let ((.cse636 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse638))) (store .cse636 .cse637 (store (select .cse636 .cse637) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse634 (select (select .cse635 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse634 (select (select .cse635 .cse634) v_arrayElimCell_176))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse637)))))) (= v_arrayElimCell_174 (_ bv0 32))))) (.cse9 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse314 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32) (_ bv0 32)))) (let ((.cse15 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse633 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse631 (select (select .cse633 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse631) (not (let ((.cse632 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse632 (select (select (store (store .cse633 .cse631 (store (select .cse633 .cse631) (_ bv0 32) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse632) v_arrayElimCell_175)))) (= .cse631 (_ bv0 32))))))) (.cse287 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse630 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse629 (select .cse630 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse626 (store (let ((.cse628 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse630))) (store .cse628 .cse629 (store (select .cse628 .cse629) (_ bv0 32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse627 (select (select .cse626 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse626 .cse627) v_arrayElimCell_176) .cse627)))) (= .cse629 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse629))))))) (.cse286 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse625 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse624 (select .cse625 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse621 (store (let ((.cse623 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse625))) (store .cse623 .cse624 (store (select .cse623 .cse624) (_ bv0 32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse622 (select (select .cse621 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse621 .cse622) (_ bv0 32)) .cse622)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse624) (= .cse624 (_ bv0 32))))))) (.cse196 (not .cse9)) (.cse52 (or .cse151 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse619 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse620 (select (select .cse619 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse617 (store (store .cse619 .cse620 (store (select .cse619 .cse620) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse618 (select (select .cse617 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse617 .cse618) v_arrayElimCell_176) .cse618)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse620)) (= v_arrayElimCell_170 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))) (.cse28 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse615 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse616 (select (select .cse615 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse613 (store (store .cse615 .cse616 (store (select .cse615 .cse616) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse614 (select (select .cse613 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse613 .cse614) v_arrayElimCell_176) .cse614)))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse616)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (= v_arrayElimCell_170 (_ bv0 32))))) (.cse315 (and .cse151 .cse9)) (.cse479 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse611 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse612 (select (select .cse611 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse610 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse610 (select (select (store (store .cse611 .cse612 (store (select .cse611 .cse612) v_arrayElimCell_170 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse610) v_arrayElimCell_175)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse612) (= v_arrayElimCell_170 (_ bv0 32))))))) (.cse480 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse608 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse609 (select (select .cse608 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse607 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse607 (select (select (store (store .cse608 .cse609 (store (select .cse608 .cse609) v_arrayElimCell_170 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse607) v_arrayElimCell_175)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse609)) (= v_arrayElimCell_170 (_ bv0 32))))))) (.cse218 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse605 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse606 (select (select .cse605 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse604 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse604 (select (select (store (store .cse605 .cse606 (store (select .cse605 .cse606) v_arrayElimCell_170 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse604) v_arrayElimCell_175)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse606))))))) (.cse219 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse602 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse603 (select (select .cse602 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse601 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse601 (select (select (store (store .cse602 .cse603 (store (select .cse602 .cse603) v_arrayElimCell_170 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse601) v_arrayElimCell_175)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse603) (= .cse603 (_ bv0 32))))))) (.cse411 (and .cse290 .cse291)) (.cse115 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse600 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse599 (select .cse600 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse596 (store (let ((.cse598 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse600))) (store .cse598 .cse599 (store (select .cse598 .cse599) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse597 (select (select .cse596 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse596 .cse597) v_arrayElimCell_170) .cse597)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse599) (= .cse599 (_ bv0 32))))))) (.cse202 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse595 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse591 (select .cse595 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse591 (_ bv0 32)) (not (let ((.cse592 (store (let ((.cse594 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse595))) (store .cse594 .cse591 (store (select .cse594 .cse591) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse593 (select (select .cse592 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse592 .cse593) v_arrayElimCell_176) .cse593)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse591))))))) (.cse270 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse590 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse587 (select (select .cse590 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse587) (not (let ((.cse588 (store (store .cse590 .cse587 (store (select .cse590 .cse587) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse589 (select (select .cse588 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse588 .cse589) v_arrayElimCell_174) .cse589)))) (= v_arrayElimCell_170 (_ bv0 32)))))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse269 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse586 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse583 (select (select .cse586 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse583) (not (let ((.cse584 (store (store .cse586 .cse583 (store (select .cse586 .cse583) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse585 (select (select .cse584 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse584 .cse585) v_arrayElimCell_174) .cse585)))) (= v_arrayElimCell_170 (_ bv0 32)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse8 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse581 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse582 (select (select .cse581 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse579 (store (store .cse581 .cse582 (store (select .cse581 .cse582) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse580 (select (select .cse579 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse579 .cse580) v_arrayElimCell_176) .cse580)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse582)) (= v_arrayElimCell_170 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse504 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse577 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse578 (select (select .cse577 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse575 (store (store .cse577 .cse578 (store (select .cse577 .cse578) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse576 (select (select .cse575 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse575 .cse576) v_arrayElimCell_176) .cse576)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse578)) (= v_arrayElimCell_170 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse54 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse573 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse574 (select (select .cse573 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse571 (store (store .cse573 .cse574 (store (select .cse573 .cse574) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse572 (select (select .cse571 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse571 .cse572) v_arrayElimCell_176) .cse572)))) (= .cse574 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse574)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse489 (and .cse288 .cse289)) (.cse18 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse570 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse567 (select (select .cse570 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse567) (not (let ((.cse568 (store (store .cse570 .cse567 (store (select .cse570 .cse567) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse569 (select (select .cse568 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse568 .cse569) (_ bv0 32)) .cse569)))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))))) (.cse58 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse566 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse563 (select (select .cse566 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse563) (not (let ((.cse564 (store (store .cse566 .cse563 (store (select .cse566 .cse563) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse565 (select (select .cse564 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse564 .cse565) (_ bv0 32)) .cse565)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= v_arrayElimCell_170 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse151)) (.cse310 (and .cse9 .cse59)) (.cse13 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 1)))) (.cse14 (= |c_ULTIMATE.start_main_~#s~0#1.base| (_ bv0 32))) (.cse137 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse562 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse560 (select (select .cse562 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse560)) (not (let ((.cse561 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse561 (select (select (store (store .cse562 .cse560 (store (select .cse562 .cse560) (_ bv0 32) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse561) v_arrayElimCell_175))))))))) (.cse390 (and .cse51 .cse1 .cse56 .cse57 .cse4)) (.cse34 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (_ bv0 1)))) (.cse48 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (_ bv0 32))) (.cse537 (and (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse554 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse550 (select .cse554 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse550) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse552 (store (let ((.cse553 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse554))) (store .cse553 .cse550 (store (select .cse553 .cse550) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse551 (select (select .cse552 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse551 (select (select .cse552 .cse551) v_arrayElimCell_171)))))) (= .cse550 (_ bv0 32)))))) .cse35 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse559 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse555 (select .cse559 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse555) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse557 (store (let ((.cse558 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse559))) (store .cse558 .cse555 (store (select .cse558 .cse555) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse556 (select (select .cse557 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse556 (select (select .cse557 .cse556) v_arrayElimCell_171)))))))))) (= v_arrayElimCell_170 (_ bv0 32)))) .cse36)) (.cse49 (not .cse59)) (.cse3 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse549 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse546 (select (select .cse549 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse546 (_ bv0 32)) (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse547 (store (store .cse549 .cse546 (store (select .cse549 .cse546) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse548 (select (select .cse547 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse547 .cse548) v_arrayElimCell_176) .cse548))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse546))))))))) (.cse5 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse545 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse542 (select (select .cse545 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse542) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse543 (store (store .cse545 .cse542 (store (select .cse545 .cse542) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse544 (select (select .cse543 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse543 .cse544) v_arrayElimCell_171) .cse544))))) (= .cse542 (_ bv0 32)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (let ((.cse10 (and .cse1 .cse3 .cse4 .cse5)) (.cse7 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse541 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse538 (select (select .cse541 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse538 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse538)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (let ((.cse540 (store (store .cse541 .cse538 (store (select .cse541 .cse538) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse539 (select (select .cse540 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse539 (select (select .cse540 .cse539) v_arrayElimCell_176))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59)) (.cse2 (or .cse34 .cse48 .cse537 .cse9 .cse49)) (.cse0 (or .cse390 .cse59)) (.cse29 (or .cse34 .cse48 .cse537 .cse49)) (.cse65 (or .cse310 .cse13 .cse14 .cse137)) (.cse66 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse535 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse536 (select (select .cse535 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse534 (store (store .cse535 .cse536 (store (select .cse535 .cse536) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse533 (select (select .cse534 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse533 (select (select .cse534 .cse533) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse536) (= .cse536 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59)) (.cse67 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse532 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse529 (select (select .cse532 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse529) (= .cse529 (_ bv0 32)) (not (let ((.cse530 (store (store .cse532 .cse529 (store (select .cse532 .cse529) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse531 (select (select .cse530 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse530 .cse531) v_arrayElimCell_170) .cse531)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse17 (or .cse59 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse528 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse525 (select (select .cse528 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse525) (not (let ((.cse526 (store (store .cse528 .cse525 (store (select .cse528 .cse525) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse527 (select (select .cse526 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse526 .cse527) (_ bv0 32)) .cse527)))) (= .cse525 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))) (.cse33 (or (and .cse18 .cse58) .cse59)) (.cse61 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse524 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse521 (select (select .cse524 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse521) (not (let ((.cse522 (store (store .cse524 .cse521 (store (select .cse524 .cse521) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse523 (select (select .cse522 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse522 .cse523) (_ bv0 32)) .cse523)))) (= .cse521 (_ bv0 32)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse271 (or .cse34 .cse48 .cse9 .cse489 .cse49)) (.cse130 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse519 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse520 (select (select .cse519 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse518 (store (store .cse519 .cse520 (store (select .cse519 .cse520) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse517 (select (select .cse518 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse517 (select (select .cse518 .cse517) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse520) (= .cse520 (_ bv0 32)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse268 (or (and .cse54 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse516 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse513 (select (select .cse516 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse513) (= .cse513 (_ bv0 32)) (not (let ((.cse514 (store (store .cse516 .cse513 (store (select .cse516 .cse513) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse515 (select (select .cse514 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse514 .cse515) v_arrayElimCell_174) .cse515)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) .cse59)) (.cse272 (or .cse59 (and .cse269 .cse8 (or .cse151 (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse512 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse509 (select (select .cse512 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse509) (not (let ((.cse510 (store (store .cse512 .cse509 (store (select .cse512 .cse509) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse511 (select (select .cse510 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse510 .cse511) v_arrayElimCell_174) .cse511)))) (= v_arrayElimCell_170 (_ bv0 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) .cse504))))) (.cse273 (or (and .cse8 .cse270 (or .cse151 (and .cse504 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse508 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse505 (select (select .cse508 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse505) (not (let ((.cse506 (store (store .cse508 .cse505 (store (select .cse508 .cse505) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse507 (select (select .cse506 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse506 .cse507) v_arrayElimCell_174) .cse507)))) (= v_arrayElimCell_170 (_ bv0 32)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) .cse59)) (.cse275 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse503 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse500 (select (select .cse503 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse500) (= .cse500 (_ bv0 32)) (not (let ((.cse501 (store (store .cse503 .cse500 (store (select .cse503 .cse500) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse502 (select (select .cse501 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse501 .cse502) v_arrayElimCell_174) .cse502)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse131 (or .cse34 .cse48 (and (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse494 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse493 (select .cse494 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse490 (store (let ((.cse492 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse494))) (store .cse492 .cse493 (store (select .cse492 .cse493) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse491 (select (select .cse490 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse490 .cse491) v_arrayElimCell_176) .cse491)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse493)))))) (= v_arrayElimCell_170 (_ bv0 32)))) .cse115 .cse202 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse499 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse498 (select .cse499 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse495 (store (let ((.cse497 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse499))) (store .cse497 .cse498 (store (select .cse497 .cse498) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse496 (select (select .cse495 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse495 .cse496) v_arrayElimCell_170) .cse496)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse498)))))))) .cse9 .cse49)) (.cse296 (or .cse34 .cse48 .cse411 .cse49)) (.cse21 (or .cse219 .cse13 .cse14)) (.cse297 (or .cse34 .cse48 .cse489 .cse49)) (.cse26 (or .cse218 .cse13 .cse14)) (.cse19 (or .cse13 .cse14 .cse480)) (.cse22 (or .cse13 .cse14 .cse479)) (.cse68 (or .cse310 .cse13 .cse14 .cse480 .cse315)) (.cse20 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse487 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse488 (select (select .cse487 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse485 (store (store .cse487 .cse488 (store (select .cse487 .cse488) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse486 (select (select .cse485 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse485 .cse486) v_arrayElimCell_176) .cse486)))) (= .cse488 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse488)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59)) (.cse86 (or .cse13 .cse14 .cse480 .cse9)) (.cse24 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse483 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse484 (select (select .cse483 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse481 (store (store .cse483 .cse484 (store (select .cse483 .cse484) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse482 (select (select .cse481 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse481 .cse482) v_arrayElimCell_176) .cse482)))) (= .cse484 (_ bv0 32)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse484)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse92 (or .cse310 .cse13 .cse14 .cse315 .cse479)) (.cse102 (or .cse13 .cse14 .cse315 .cse479)) (.cse103 (or .cse13 .cse14 .cse480 .cse315)) (.cse101 (or .cse13 .cse14 .cse9 .cse479)) (.cse30 (or (and .cse52 .cse28) .cse59)) (.cse93 (or .cse219 .cse310 .cse13 .cse14)) (.cse94 (or .cse218 .cse310 .cse13 .cse14)) (.cse167 (or .cse289 .cse9)) (.cse180 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse478 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse477 (select .cse478 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse474 (store (let ((.cse476 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse478))) (store .cse476 .cse477 (store (select .cse476 .cse477) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse475 (select (select .cse474 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse474 .cse475) v_arrayElimCell_175) .cse475)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse477)))))) .cse196)) (.cse181 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse473 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse472 (select .cse473 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse469 (store (let ((.cse471 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse473))) (store .cse471 .cse472 (store (select .cse471 .cse472) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse470 (select (select .cse469 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse469 .cse470) v_arrayElimCell_175) .cse470)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse472) (= .cse472 (_ bv0 32)))))) .cse196)) (.cse154 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse468 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse467 (select .cse468 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_arrayElimCell_174 (_ bv0 32)) (not (let ((.cse464 (store (let ((.cse466 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse468))) (store .cse466 .cse467 (store (select .cse466 .cse467) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse465 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse464 .cse465) v_arrayElimCell_175) .cse465)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse467)))))) .cse196)) (.cse160 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse463 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse462 (select .cse463 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_arrayElimCell_174 (_ bv0 32)) (not (let ((.cse460 (store (let ((.cse461 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse463))) (store .cse461 .cse462 (store (select .cse461 .cse462) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse459 (select (select .cse460 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse459 (select (select .cse460 .cse459) v_arrayElimCell_176))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse462)))))) .cse9)) (.cse161 (or .cse196 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse458 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse457 (select .cse458 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_arrayElimCell_174 (_ bv0 32)) (not (let ((.cse454 (store (let ((.cse456 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse458))) (store .cse456 .cse457 (store (select .cse456 .cse457) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse455 (select (select .cse454 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse454 .cse455) v_arrayElimCell_175) .cse455)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse457))))))) (.cse32 (= |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))) (.cse132 (or .cse34 .cse48 (and (or .cse287 .cse9) (or .cse196 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse448 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse447 (select .cse448 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse445 (store (let ((.cse446 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse448))) (store .cse446 .cse447 (store (select .cse446 .cse447) (_ bv0 32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse444 (select (select .cse445 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse444 (select (select .cse445 .cse444) v_arrayElimCell_175))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse447) (= .cse447 (_ bv0 32))))))) (or .cse286 .cse9) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse453 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse452 (select .cse453 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse450 (store (let ((.cse451 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse453))) (store .cse451 .cse452 (store (select .cse451 .cse452) (_ bv0 32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse449 (select (select .cse450 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse449 (select (select .cse450 .cse449) v_arrayElimCell_175))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse452)))))) .cse196)) .cse49)) (.cse168 (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse443 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse439 (select .cse443 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse439) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse440 (store (let ((.cse442 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse443))) (store .cse442 .cse439 (store (select .cse442 .cse439) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse441 (select (select .cse440 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse440 .cse441) v_arrayElimCell_171) .cse441))))) (= .cse439 (_ bv0 32))))))) (.cse169 (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse438 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse437 (select .cse438 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse435 (store (let ((.cse436 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse438))) (store .cse436 .cse437 (store (select .cse436 .cse437) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse434 (select (select .cse435 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse434 (select (select .cse435 .cse434) v_arrayElimCell_176)))))) (= .cse437 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse437))))))) (.cse152 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse433 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse429 (select .cse433 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse429) (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse430 (store (let ((.cse432 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse433))) (store .cse432 .cse429 (store (select .cse432 .cse429) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse431 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse430 .cse431) v_arrayElimCell_171) .cse431)))))))))))) (.cse153 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse428 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse427 (select .cse428 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (not (let ((.cse425 (store (let ((.cse426 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse428))) (store .cse426 .cse427 (store (select .cse426 .cse427) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse424 (select (select .cse425 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse424 (select (select .cse425 .cse424) v_arrayElimCell_176)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse427))))))))) (.cse276 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse423 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse420 (select (select .cse423 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse420) (not (let ((.cse422 (store (store .cse423 .cse420 (store (select .cse423 .cse420) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse421 (select (select .cse422 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse421 (select (select .cse422 .cse421) v_arrayElimCell_174))))))))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse277 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse418 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse417 (store (store .cse418 .cse419 (store (select .cse418 .cse419) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse416 (select (select .cse417 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse416 (select (select .cse417 .cse416) v_arrayElimCell_176))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse419)))))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse142 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse415 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse412 (select (select .cse415 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse412 (_ bv0 32)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse412)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (let ((.cse414 (store (store .cse415 .cse412 (store (select .cse415 .cse412) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse413 (select (select .cse414 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse413 (select (select .cse414 .cse413) v_arrayElimCell_176))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse274 (or .cse34 .cse48 .cse9 .cse411 .cse49)) (.cse108 (or .cse151 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse410 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse407 (select (select .cse410 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse407) (not (let ((.cse408 (store (store .cse410 .cse407 (store (select .cse410 .cse407) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse409 (select (select .cse408 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse408 .cse409) v_arrayElimCell_170) .cse409)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= v_arrayElimCell_170 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))) (.cse6 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse109 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse406 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse403 (select (select .cse406 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse403) (= .cse403 (_ bv0 32)) (not (let ((.cse404 (store (store .cse406 .cse403 (store (select .cse406 .cse403) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse405 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse404 .cse405) v_arrayElimCell_170) .cse405)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse110 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse402 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse399 (select (select .cse402 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse399) (not (let ((.cse400 (store (store .cse402 .cse399 (store (select .cse402 .cse399) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse401 (select (select .cse400 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse400 .cse401) v_arrayElimCell_170) .cse401)))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (= v_arrayElimCell_170 (_ bv0 32))))) (.cse64 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse397 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse398 (select (select .cse397 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse395 (store (store .cse397 .cse398 (store (select .cse397 .cse398) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse396 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse395 .cse396) v_arrayElimCell_176) .cse396)))) (= .cse398 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse398)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse125 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse394 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse391 (select (select .cse394 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse391) (not (let ((.cse392 (store (store .cse394 .cse391 (store (select .cse394 .cse391) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse393 (select (select .cse392 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse392 .cse393) v_arrayElimCell_170) .cse393)))) (= v_arrayElimCell_170 (_ bv0 32))))))))) (.cse182 (or .cse310 .cse13 .cse14 .cse15))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) .cse7 .cse8 (or .cse9 .cse10) (or .cse10 .cse6) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32)) (let ((.cse53 (or .cse151 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse259 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse256 (select (select .cse259 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse256) (not (let ((.cse257 (store (store .cse259 .cse256 (store (select .cse259 .cse256) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse258 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse257 .cse258) v_arrayElimCell_171) .cse258)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= v_arrayElimCell_170 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))) (.cse27 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse255 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse252 (select (select .cse255 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse252) (not (let ((.cse253 (store (store .cse255 .cse252 (store (select .cse255 .cse252) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse254 (select (select .cse253 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse253 .cse254) v_arrayElimCell_171) .cse254)))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))))) (let ((.cse16 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse251 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse248 (select (select .cse251 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse248) (not (let ((.cse249 (store (store .cse251 .cse248 (store (select .cse251 .cse248) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse250 (select (select .cse249 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse249 .cse250) (_ bv0 32)) .cse250)))) (= .cse248 (_ bv0 32)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse23 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse247 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse244 (select (select .cse247 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse244) (= .cse244 (_ bv0 32)) (not (let ((.cse245 (store (store .cse247 .cse244 (store (select .cse247 .cse244) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse246 (select (select .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse245 .cse246) v_arrayElimCell_171) .cse246)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59)) (.cse25 (or (and .cse53 .cse27) .cse59)) (.cse31 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse243 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse240 (select (select .cse243 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse240) (= .cse240 (_ bv0 32)) (not (let ((.cse241 (store (store .cse243 .cse240 (store (select .cse243 .cse240) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse242 (select (select .cse241 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse241 .cse242) v_arrayElimCell_171) .cse242)))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse62 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse239 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse236 (select (select .cse239 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse236) (not (let ((.cse237 (store (store .cse239 .cse236 (store (select .cse239 .cse236) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse238 (select (select .cse237 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse237 .cse238) v_arrayElimCell_171) .cse238)))) (= v_arrayElimCell_170 (_ bv0 32)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse63 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse235 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse232 (select (select .cse235 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse232) (= .cse232 (_ bv0 32)) (not (let ((.cse233 (store (store .cse235 .cse232 (store (select .cse235 .cse232) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse234 (select (select .cse233 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse233 .cse234) v_arrayElimCell_171) .cse234)))))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse50 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse231 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse228 (select (select .cse231 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse228) (not (let ((.cse229 (store (store .cse231 .cse228 (store (select .cse231 .cse228) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse230 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse229 .cse230) (_ bv0 32)) .cse230)))) (= .cse228 (_ bv0 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse55 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse227 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse224 (select (select .cse227 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse224) (= .cse224 (_ bv0 32)) (not (let ((.cse225 (store (store .cse227 .cse224 (store (select .cse227 .cse224) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse226 (select (select .cse225 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse225 .cse226) v_arrayElimCell_171) .cse226)))))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse60 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse223 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse220 (select (select .cse223 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse220) (not (let ((.cse221 (store (store .cse223 .cse220 (store (select .cse223 .cse220) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse222 (select (select .cse221 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse221 .cse222) (_ bv0 32)) .cse222)))) (= v_arrayElimCell_170 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse69 (or .cse219 .cse13 .cse14 .cse9)) (.cse100 (or .cse218 .cse13 .cse14 .cse9)) (.cse70 (or .cse196 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse217 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse216 (select .cse217 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse213 (store (let ((.cse215 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse217))) (store .cse215 .cse216 (store (select .cse215 .cse216) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse214 (select (select .cse213 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse213 .cse214) v_arrayElimCell_175) .cse214)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse216)))))))) (.cse71 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse212 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse211 (select .cse212 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_arrayElimCell_170 (_ bv0 32)) (not (let ((.cse208 (store (let ((.cse210 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse212))) (store .cse210 .cse211 (store (select .cse210 .cse211) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse209 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse208 .cse209) v_arrayElimCell_176) .cse209)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse211)))))) .cse9)) (.cse77 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse207 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse206 (select .cse207 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse203 (store (let ((.cse205 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse207))) (store .cse205 .cse206 (store (select .cse205 .cse206) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse204 (select (select .cse203 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse203 .cse204) v_arrayElimCell_175) .cse204)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse206) (= .cse206 (_ bv0 32)))))) .cse196)) (.cse78 (or .cse9 .cse202)) (.cse79 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse201 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse200 (select .cse201 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse197 (store (let ((.cse199 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse201))) (store .cse199 .cse200 (store (select .cse199 .cse200) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse198 (select (select .cse197 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse197 .cse198) v_arrayElimCell_175) .cse198)))) (= v_arrayElimCell_170 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse200)))))) .cse196)) (.cse80 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse195 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse194 (select .cse195 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse191 (store (let ((.cse193 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse195))) (store .cse193 .cse194 (store (select .cse193 .cse194) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse192 (select (select .cse191 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse191 .cse192) v_arrayElimCell_175) .cse192)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse194) (= v_arrayElimCell_170 (_ bv0 32)))))) .cse196)) (.cse11 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse187 (select (select .cse190 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse187) (not (let ((.cse188 (store (store .cse190 .cse187 (store (select .cse190 .cse187) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse189 (select (select .cse188 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse188 .cse189) v_arrayElimCell_170) .cse189)))))))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) (.cse12 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse185 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse186 (select (select .cse185 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse183 (store (store .cse185 .cse186 (store (select .cse185 .cse186) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse184 (select (select .cse183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse183 .cse184) v_arrayElimCell_176) .cse184)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse186)))))) (= v_arrayElimCell_170 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (and .cse11 .cse7 .cse12 (or .cse13 .cse14 .cse9 .cse15) (or (and .cse16 .cse17 .cse8 .cse18 .cse0 (or (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) .cse32) .cse19 .cse20 .cse21 .cse22 .cse33 .cse1 .cse24 (or .cse34 (and .cse35 .cse36 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32))) (let ((.cse41 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse37) (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse38 (store (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse41))) (store .cse40 .cse37 (store (select .cse40 .cse37) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse38 .cse39) (_ bv0 32)) .cse39))))))))) (= v_arrayElimCell_170 (_ bv0 32)))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32))) (let ((.cse47 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse43) (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse44 (store (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse47))) (store .cse46 .cse43 (store (select .cse46 .cse43) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse45 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse44 .cse45) (_ bv0 32)) .cse45))))) (= .cse43 (_ bv0 32))))))) .cse48 .cse49) .cse3 (or (and .cse18 .cse50 .cse19 .cse51 .cse21 .cse22 .cse52 .cse1 (or (and .cse19 .cse21 .cse22 .cse52 .cse53 .cse54 .cse26 .cse27 .cse28 .cse55) .cse32) .cse56 .cse57 .cse54 .cse58 .cse26 .cse4 .cse28) .cse59) .cse26 .cse4 .cse60 .cse28 .cse29 .cse61 (or (and .cse8 .cse19 .cse21 .cse22 .cse62 .cse63 .cse26 .cse64) .cse32) .cse30 .cse64 .cse5) .cse9) .cse65 .cse66 .cse67 (or (and .cse16 .cse17 .cse68 .cse8 .cse18 .cse69 .cse0 (or .cse34 (and .cse70 .cse71 (or .cse9 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse75 (select .cse76 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse72 (store (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse76))) (store .cse74 .cse75 (store (select .cse74 .cse75) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse73 (select (select .cse72 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse72 .cse73) (_ bv0 32)) .cse73)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse75) (= v_arrayElimCell_170 (_ bv0 32))))))) .cse77 .cse78 .cse79 .cse80 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse84 (select .cse85 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse81 (store (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse85))) (store .cse83 .cse84 (store (select .cse83 .cse84) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse81 .cse82) (_ bv0 32)) .cse82)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse84) (= .cse84 (_ bv0 32)))))) .cse9)) .cse48 .cse49) .cse20 .cse33 .cse86 .cse1 .cse24 (or (and .cse68 (or (and .cse70 (or .cse9 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse87 (select .cse91 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse87) (= .cse87 (_ bv0 32)) (not (let ((.cse89 (store (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse91))) (store .cse90 .cse87 (store (select .cse90 .cse87) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse88 (select (select .cse89 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse88 (select (select .cse89 .cse88) v_arrayElimCell_171)))))))))) .cse77 .cse78) .cse34 .cse48 .cse49) .cse20 .cse23 .cse24 .cse92 .cse25 .cse27 .cse28 .cse30 .cse93 .cse31 .cse94 (or (and (or .cse9 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse95 (select .cse99 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse95) (= v_arrayElimCell_170 (_ bv0 32)) (not (let ((.cse97 (store (let ((.cse98 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse99))) (store .cse98 .cse95 (store (select .cse98 .cse95) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse96 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse96 (select (select .cse97 .cse96) v_arrayElimCell_171)))))))))) .cse71 .cse79 .cse80) .cse34 .cse48 .cse49)) .cse32) (or (and .cse8 .cse69 .cse62 .cse86 .cse63 .cse100 .cse101 .cse64) .cse32) .cse100 .cse92 .cse2 .cse3 (or (and .cse18 .cse102 .cse50 .cse51 .cse21 .cse52 .cse1 .cse56 .cse57 (or (and .cse102 .cse21 .cse52 .cse53 .cse54 .cse26 .cse27 .cse28 .cse55 .cse103) .cse32) .cse54 .cse58 .cse26 .cse4 .cse28 .cse103) .cse59) .cse4 .cse60 .cse28 .cse61 .cse101 .cse30 .cse64 .cse5 .cse93 .cse94) .cse6) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse107 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse104 (select (select .cse107 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse104 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse104)) (not (let ((.cse106 (store (store .cse107 .cse104 (store (select .cse107 .cse104) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse105 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse105 (select (select .cse106 .cse105) v_arrayElimCell_176))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) (or (and (or (and .cse108 .cse102 .cse21 .cse52 .cse109 .cse110 .cse54 .cse26 .cse28 .cse103) .cse59) .cse68 .cse8 .cse69 .cse20 (or (and .cse108 .cse110) .cse59) .cse67 .cse86 .cse24 .cse100 .cse92 .cse110 .cse28 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse111 (select (select .cse114 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse111) (= .cse111 (_ bv0 32)) (not (let ((.cse112 (store (store .cse114 .cse111 (store (select .cse114 .cse111) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse112 .cse113) v_arrayElimCell_170) .cse113)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59) (or (and .cse70 .cse71 .cse77 .cse78 .cse79 .cse80 (or .cse115 .cse9) (or .cse9 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse119 (select .cse120 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse116 (store (let ((.cse118 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse120))) (store .cse118 .cse119 (store (select .cse118 .cse119) v_arrayElimCell_170 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse117 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse116 .cse117) v_arrayElimCell_170) .cse117)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse119) (= v_arrayElimCell_170 (_ bv0 32)))))))) .cse34 .cse48 .cse49) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse121 (select (select .cse124 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse121) (= .cse121 (_ bv0 32)) (not (let ((.cse122 (store (store .cse124 .cse121 (store (select .cse124 .cse121) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse123 (select (select .cse122 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse122 .cse123) v_arrayElimCell_170) .cse123)))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse101 .cse30 .cse64 .cse93 .cse125 .cse94) .cse32) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse129 (select (select .cse128 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse127 (store (store .cse128 .cse129 (store (select .cse128 .cse129) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse126 (select (select .cse127 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse126 (select (select .cse127 .cse126) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse129) (= .cse129 (_ bv0 32)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) .cse130 .cse131 .cse132 (or (and (or .cse13 .cse14 .cse15) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse135 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse136 (select (select .cse135 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse134 (store (store .cse135 .cse136 (store (select .cse135 .cse136) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse133 (select (select .cse134 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse133 (select (select .cse134 .cse133) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse136) (= .cse136 (_ bv0 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) (or .cse13 .cse14 .cse137) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse141 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse138 (select (select .cse141 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse138 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse138)) (not (let ((.cse140 (store (store .cse141 .cse138 (store (select .cse141 .cse138) (_ bv0 32) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse139 (select (select .cse140 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse139 (select (select .cse140 .cse139) v_arrayElimCell_176))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) .cse59) .cse142 (or (and .cse11 (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse145 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse146 (select (select .cse145 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse143 (store (store .cse145 .cse146 (store (select .cse145 .cse146) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse144 (select (select .cse143 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse143 .cse144) v_arrayElimCell_176) .cse144)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse146)))))) (= v_arrayElimCell_170 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (= v_arrayElimCell_170 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse147 (select (select .cse150 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse147) (not (let ((.cse148 (store (store .cse150 .cse147 (store (select .cse150 .cse147) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse149 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse148 .cse149) v_arrayElimCell_170) .cse149)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) .cse151) .cse12 .cse109 .cse54) .cse59) (or .cse34 .cse48 .cse49 (and (or .cse9 (and .cse152 .cse153)) .cse154 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse159 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse158 (select .cse159 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse156 (store (let ((.cse157 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse159))) (store .cse157 .cse158 (store (select .cse157 .cse158) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse155 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse155 (select (select .cse156 .cse155) (_ bv0 32)))))) (= v_arrayElimCell_174 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse158))))) .cse9) (or (and .cse154 .cse160 .cse161 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse166 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse162 (select .cse166 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_arrayElimCell_174 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse162) (not (let ((.cse163 (store (let ((.cse165 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse166))) (store .cse165 .cse162 (store (select .cse165 .cse162) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse164 (select (select .cse163 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse163 .cse164) v_arrayElimCell_171) .cse164)))))))) .cse9)) .cse32) .cse160 .cse167 (or (and .cse168 .cse169) .cse9) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse174 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse173 (select .cse174 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse171 (store (let ((.cse172 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse174))) (store .cse172 .cse173 (store (select .cse172 .cse173) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse170 (select (select .cse171 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse170 (select (select .cse171 .cse170) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse173) (= .cse173 (_ bv0 32)))))) .cse9) (or (and (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse175 (select .cse179 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse175) (= .cse175 (_ bv0 32)) (not (let ((.cse176 (store (let ((.cse178 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse179))) (store .cse178 .cse175 (store (select .cse178 .cse175) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse177 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse176 .cse177) v_arrayElimCell_171) .cse177)))))))) .cse9) .cse167 .cse180 .cse181) .cse32) .cse161 .cse180 .cse181)) .cse64 (or .cse13 .cse14 .cse9 .cse137) .cse182)))) (or (and .cse0 .cse1 .cse3 .cse4 .cse29 .cse5) .cse9) (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse262 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse263 (select (select .cse262 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse261 (store (store .cse262 .cse263 (store (select .cse262 .cse263) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse260 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse260 (select (select .cse261 .cse260) v_arrayElimCell_176))))) (= .cse263 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse263)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse267 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse264 (select (select .cse267 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse264) (= .cse264 (_ bv0 32)) (not (let ((.cse266 (store (store .cse267 .cse264 (store (select .cse267 .cse264) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse265 (select (select .cse266 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse265 (select (select .cse266 .cse265) v_arrayElimCell_174))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) .cse59) .cse65 .cse66 (or .cse6 (and .cse17 .cse68 .cse18 .cse20 .cse33 .cse24 .cse92 .cse132 .cse28 .cse61 .cse30 .cse93 .cse94)) .cse67 (or (and .cse268 .cse269 .cse8 .cse270 .cse271 .cse272 .cse273 .cse274 .cse275 .cse64) .cse6) (or (and .cse276 .cse277 (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse280 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse281 (select (select .cse280 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse279 (store (store .cse280 .cse281 (store (select .cse280 .cse281) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse278 (select (select .cse279 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse278 (select (select .cse279 .cse278) v_arrayElimCell_176))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse281)))))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse285 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse282 (select (select .cse285 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse282) (not (let ((.cse284 (store (store .cse285 .cse282 (store (select .cse285 .cse282) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse283 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse283 (select (select .cse284 .cse283) v_arrayElimCell_174))))))))))) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))) .cse151)) .cse59) (or (and .cse17 (or .cse34 .cse48 (and .cse286 .cse287) .cse49) .cse18 .cse19 .cse20 .cse21 .cse22 .cse33 .cse24 .cse26 .cse28 .cse61 .cse30) .cse9) (or (and .cse288 .cse289 .cse290 .cse291) .cse34 .cse48 .cse9 .cse49) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse294 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse295 (select (select .cse294 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse293 (store (store .cse294 .cse295 (store (select .cse294 .cse295) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse292 (select (select .cse293 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse292 (select (select .cse293 .cse292) v_arrayElimCell_176))))) (= .cse295 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse295)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) .cse271 .cse130 (or .cse9 (and .cse268 .cse269 .cse8 .cse296 .cse270 .cse272 .cse297 .cse273 .cse275 .cse64)) .cse131 (or (let ((.cse301 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse385 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse382 (select (select .cse385 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse382) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (let ((.cse383 (store (store .cse385 .cse382 (store (select .cse385 .cse382) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse384 (select (select .cse383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse383 .cse384) v_arrayElimCell_174) .cse384)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (= v_arrayElimCell_170 (_ bv0 32))))))) (.cse348 (or .cse288 .cse9)) (.cse347 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse381 (store .cse42 (_ bv4 32) v_ArrVal_1335))) (let ((.cse380 (select .cse381 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse378 (store (let ((.cse379 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse381))) (store .cse379 .cse380 (store (select .cse379 .cse380) v_arrayElimCell_174 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_1326))) (let ((.cse377 (select (select .cse378 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse377 (select (select .cse378 .cse377) v_arrayElimCell_174))))) (= v_arrayElimCell_174 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse380))))) .cse9))) (let ((.cse327 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse375 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse376 (select (select .cse375 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse374 (store (store .cse375 .cse376 (store (select .cse375 .cse376) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse373 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse373 (select (select .cse374 .cse373) v_arrayElimCell_176))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse376)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))))) (.cse309 (forall ((v_arrayElimCell_174 (_ BitVec 32))) (or (= v_arrayElimCell_174 (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse372 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse369 (select (select .cse372 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse369) (not (let ((.cse371 (store (store .cse372 .cse369 (store (select .cse372 .cse369) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse370 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse370 (select (select .cse371 .cse370) v_arrayElimCell_174))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))))) (.cse299 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse368 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse365 (select (select .cse368 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse365) (= .cse365 (_ bv0 32)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (let ((.cse366 (store (store .cse368 .cse365 (store (select .cse368 .cse365) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse367 (select (select .cse366 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse366 .cse367) v_arrayElimCell_174) .cse367)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) (.cse298 (or (and .cse154 .cse347 .cse160 .cse161) .cse34 .cse48 .cse49)) (.cse320 (or (and .cse348 .cse167 .cse180 .cse181) .cse34 .cse48 .cse49)) (.cse300 (or (and (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse364 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse361 (select (select .cse364 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse361) (= v_arrayElimCell_174 (_ bv0 32)) (not (let ((.cse362 (store (store .cse364 .cse361 (store (select .cse364 .cse361) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse363 (select (select .cse362 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse362 .cse363) v_arrayElimCell_174) .cse363)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= v_arrayElimCell_170 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse151) .cse301) .cse59)) (.cse303 (or .cse151 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse360 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse357 (select (select .cse360 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse357) (not (let ((.cse358 (store (store .cse360 .cse357 (store (select .cse360 .cse357) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse359 (select (select .cse358 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse358 .cse359) v_arrayElimCell_174) .cse359)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= v_arrayElimCell_170 (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))) (.cse304 (forall ((v_arrayElimCell_170 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse356 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse353 (select (select .cse356 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse353) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (let ((.cse354 (store (store .cse356 .cse353 (store (select .cse356 .cse353) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse355 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse354 .cse355) v_arrayElimCell_174) .cse355)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (= v_arrayElimCell_170 (_ bv0 32))))) (.cse302 (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse352 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse349 (select (select .cse352 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse349) (= .cse349 (_ bv0 32)) (not (let ((.cse350 (store (store .cse352 .cse349 (store (select .cse352 .cse349) v_arrayElimCell_170 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse351 (select (select .cse350 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse350 .cse351) v_arrayElimCell_174) .cse351)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59))) (and .cse298 (or (and .cse299 .cse269 .cse8 .cse296 .cse19 .cse20 .cse21 .cse22 .cse24 .cse297 .cse26 .cse300 .cse28 .cse301 .cse30 .cse302 (or (and .cse19 .cse22 .cse52 .cse303 .cse28 .cse304) .cse59)) .cse9) (or (and (or .cse151 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse308 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse305 (select (select .cse308 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse305) (= v_arrayElimCell_174 (_ bv0 32)) (not (let ((.cse307 (store (store .cse308 .cse305 (store (select .cse308 .cse305) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse306 (select (select .cse307 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse306 (select (select .cse307 .cse306) v_arrayElimCell_174))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32))))))) .cse309) .cse59) (or .cse310 .cse13 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse313 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse311 (select (select .cse313 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse311) (= v_arrayElimCell_174 (_ bv0 32)) (not (let ((.cse312 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse312 (select (select (store (store .cse313 .cse311 (store (select .cse313 .cse311) v_arrayElimCell_174 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse312) v_arrayElimCell_175)))))))) .cse14 .cse315) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse318 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse319 (select (select .cse318 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse317 (store (store .cse318 .cse319 (store (select .cse318 .cse319) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse316 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse316 (select (select .cse317 .cse316) v_arrayElimCell_176))))) (= .cse319 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse319)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59) .cse320 (or .cse310 .cse13 (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse323 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse321 (select (select .cse323 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse321)) (not (let ((.cse322 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse322 (select (select (store (store .cse323 .cse321 (store (select .cse323 .cse321) v_arrayElimCell_174 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse322) v_arrayElimCell_175)))))))) .cse14) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse326 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse324 (select (select .cse326 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse324) (not (let ((.cse325 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse325 (select (select (store (store .cse326 .cse324 (store (select .cse326 .cse324) v_arrayElimCell_174 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse325) v_arrayElimCell_175)))) (= .cse324 (_ bv0 32)))))) .cse310 .cse13 .cse14) .cse327 (or (and .cse327 (or .cse151 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse330 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse331 (select (select .cse330 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse329 (store (store .cse330 .cse331 (store (select .cse330 .cse331) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse328 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse328 (select (select .cse329 .cse328) v_arrayElimCell_176))))) (= v_arrayElimCell_174 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse331)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))))) .cse59) .cse309 (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse334 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse314 (_ bv4 32) v_ArrVal_1335)))) (let ((.cse332 (select (select .cse334 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_arrayElimCell_174 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse332)) (not (let ((.cse333 (select v_ArrVal_1326 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse333 (select (select (store (store .cse334 .cse332 (store (select .cse334 .cse332) v_arrayElimCell_174 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1326) .cse333) v_arrayElimCell_175)))))))) .cse310 .cse13 .cse14 .cse315) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse338 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse335 (select (select .cse338 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse335) (= .cse335 (_ bv0 32)) (not (let ((.cse337 (store (store .cse338 .cse335 (store (select .cse338 .cse335) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse336 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse336 (select (select .cse337 .cse336) v_arrayElimCell_174))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) .cse59) (or (and .cse299 .cse269 .cse298 .cse68 .cse8 .cse320 .cse20 .cse86 .cse24 .cse92 .cse300 .cse28 (or (and .cse102 .cse52 .cse303 .cse28 .cse304 .cse103) .cse59) .cse301 .cse101 .cse30 .cse302 .cse93 .cse94) .cse6) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse341 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse342 (select (select .cse341 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse340 (store (store .cse341 .cse342 (store (select .cse341 .cse342) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse339 (select (select .cse340 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse339 (select (select .cse340 .cse339) v_arrayElimCell_176))))) (= .cse342 (_ bv0 32)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse342)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32)) (v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse346 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse343 (select (select .cse346 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse343) (= .cse343 (_ bv0 32)) (not (let ((.cse345 (store (store .cse346 .cse343 (store (select .cse346 .cse343) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse344 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse344 (select (select .cse345 .cse344) v_arrayElimCell_174))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))))) (or .cse34 (and .cse154 .cse347 .cse160 .cse348 .cse167 .cse161 .cse180 .cse181) .cse48 .cse49)))) .cse32) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_1335 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse389 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1335)))) (let ((.cse386 (select (select .cse389 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse386) (= .cse386 (_ bv0 32)) (not (let ((.cse388 (store (store .cse389 .cse386 (store (select .cse389 .cse386) v_arrayElimCell_174 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse387 (select (select .cse388 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse387 (select (select .cse388 .cse387) v_arrayElimCell_174))))))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38|) (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_38| (_ bv0 32)))) .cse132 (or .cse34 .cse48 .cse9 (and .cse168 .cse169 .cse152 .cse153) .cse49) .cse276 (or (and .cse108 .cse52 .cse109 .cse110 .cse54 .cse28) .cse59) .cse277 .cse142 .cse274 (or (and .cse108 .cse52 (or .cse390 .cse6) .cse109 .cse110 .cse54 .cse28 (or .cse390 .cse9)) .cse59) .cse64 .cse125 .cse182))))) is different from true [2022-11-03 02:16:20,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774961483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:16:20,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:20,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 23] total 60 [2022-11-03 02:16:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459358208] [2022-11-03 02:16:20,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:20,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 02:16:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:16:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 02:16:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4461, Unknown=19, NotChecked=980, Total=5700 [2022-11-03 02:16:20,735 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 60 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 47 states have internal predecessors, (82), 6 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:16:31,034 WARN L234 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 59 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:16:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:45,980 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-11-03 02:16:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 02:16:45,981 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 47 states have internal predecessors, (82), 6 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 37 [2022-11-03 02:16:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:45,996 INFO L225 Difference]: With dead ends: 63 [2022-11-03 02:16:45,996 INFO L226 Difference]: Without dead ends: 60 [2022-11-03 02:16:45,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=477, Invalid=8652, Unknown=19, NotChecked=1358, Total=10506 [2022-11-03 02:16:45,999 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:45,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 503 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 314 Invalid, 0 Unknown, 241 Unchecked, 2.3s Time] [2022-11-03 02:16:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-03 02:16:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-11-03 02:16:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.148936170212766) internal successors, (54), 48 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:16:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2022-11-03 02:16:46,027 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 37 [2022-11-03 02:16:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2022-11-03 02:16:46,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 47 states have internal predecessors, (82), 6 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:16:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-11-03 02:16:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:16:46,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:46,029 INFO L195 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] [2022-11-03 02:16:46,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:46,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:46,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-11-03 02:16:46,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:16:46,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2022-11-03 02:16:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:16:46,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983477549] [2022-11-03 02:16:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:46,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:16:46,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:16:46,645 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:16:46,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52868d96-8098-4ded-b7fc-4544db3f9dc7/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 02:16:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:47,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-03 02:16:47,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:47,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:16:48,293 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:16:48,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:16:48,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:16:49,002 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:16:49,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 31 [2022-11-03 02:16:49,645 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:16:49,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 26 [2022-11-03 02:16:49,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:16:49,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:16:50,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:16:50,809 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-03 02:16:50,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 59 [2022-11-03 02:16:50,914 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:16:50,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 [2022-11-03 02:16:51,031 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-03 02:16:51,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-03 02:16:51,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 26 [2022-11-03 02:16:51,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 58 [2022-11-03 02:16:53,241 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:16:53,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 75 [2022-11-03 02:16:53,421 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:16:53,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 125 [2022-11-03 02:16:53,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:53,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 35 [2022-11-03 02:16:53,520 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-03 02:16:53,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 82 [2022-11-03 02:16:53,655 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 02:16:53,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 94 [2022-11-03 02:16:53,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 [2022-11-03 02:16:54,501 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:16:54,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 47 [2022-11-03 02:16:54,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-03 02:16:54,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:16:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:55,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:56,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1421 (_ BitVec 32)) (v_ArrVal_1418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1413)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1418))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1416))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1421))) (select (select .cse1 .cse2) .cse3)) (bvadd (select (select .cse4 .cse2) .cse3) (_ bv4 32))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 02:16:56,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1421 (_ BitVec 32)) (v_ArrVal_1418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1413)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1418))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1416))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1421))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-03 02:16:56,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1421 (_ BitVec 32)) (v_ArrVal_1418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1413)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1418))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1416))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1421))) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-11-03 02:16:57,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:16:57,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 305 treesize of output 298 [2022-11-03 02:16:57,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:16:57,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2968 treesize of output 2840 [2022-11-03 02:16:57,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3232 treesize of output 2712 [2022-11-03 02:16:58,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 948 [2022-11-03 02:18:41,697 WARN L234 SmtUtils]: Spent 1.71m on a formula simplification that was a NOOP. DAG size: 150 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:18:41,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:18:41,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2415 treesize of output 3859