./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:16:46,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:16:46,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:16:46,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:16:46,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:16:46,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:16:46,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:16:46,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:16:46,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:16:46,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:16:46,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:16:46,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:16:46,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:16:46,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:16:46,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:16:46,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:16:46,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:16:46,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:16:46,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:16:46,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:16:46,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:16:46,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:16:46,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:16:46,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:16:46,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:16:46,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:16:46,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:16:46,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:16:46,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:16:46,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:16:46,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:16:46,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:16:46,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:16:46,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:16:46,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:16:46,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:16:46,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:16:46,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:16:46,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:16:46,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:16:46,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:16:46,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:16:46,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:16:46,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:16:46,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:16:46,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:16:46,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:16:46,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:16:46,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:16:46,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:16:46,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:16:46,507 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:16:46,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:16:46,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:16:46,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:16:46,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:16:46,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:16:46,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:16:46,509 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:16:46,509 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:16:46,510 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:16:46,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:16:46,510 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:16:46,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:16:46,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:16:46,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:16:46,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:16:46,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:16:46,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:46,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:16:46,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:16:46,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:16:46,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:16:46,513 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-07-12 19:16:46,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:16:46,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:16:46,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:16:46,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:16:46,753 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:16:46,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-12 19:16:46,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484f81890/850f116c8f4e4560a6f636ee628d8e81/FLAG596a4ceae [2022-07-12 19:16:47,210 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:16:47,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-12 19:16:47,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484f81890/850f116c8f4e4560a6f636ee628d8e81/FLAG596a4ceae [2022-07-12 19:16:47,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484f81890/850f116c8f4e4560a6f636ee628d8e81 [2022-07-12 19:16:47,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:16:47,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:16:47,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:47,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:16:47,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:16:47,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:47,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aeba8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47, skipping insertion in model container [2022-07-12 19:16:47,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:47,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:16:47,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:16:47,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-07-12 19:16:47,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:47,876 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:16:47,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-07-12 19:16:47,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:47,940 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:16:47,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47 WrapperNode [2022-07-12 19:16:47,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:47,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:47,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:16:47,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:16:47,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:47,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:47,997 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2022-07-12 19:16:47,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:47,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:16:47,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:16:47,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:16:48,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:16:48,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:16:48,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:16:48,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:16:48,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (1/1) ... [2022-07-12 19:16:48,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:48,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:48,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:16:48,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:16:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:16:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:16:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:16:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:16:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:16:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:16:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:16:48,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:16:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:16:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:16:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:16:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:16:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:16:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:16:48,239 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:16:48,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:16:48,503 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:16:48,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:16:48,509 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 19:16:48,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:48 BoogieIcfgContainer [2022-07-12 19:16:48,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:16:48,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:16:48,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:16:48,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:16:48,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:16:47" (1/3) ... [2022-07-12 19:16:48,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbf979f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:48, skipping insertion in model container [2022-07-12 19:16:48,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:47" (2/3) ... [2022-07-12 19:16:48,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbf979f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:48, skipping insertion in model container [2022-07-12 19:16:48,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:48" (3/3) ... [2022-07-12 19:16:48,530 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-07-12 19:16:48,540 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:16:48,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-07-12 19:16:48,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:16:48,575 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59e02c7d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f4ccc76 [2022-07-12 19:16:48,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-07-12 19:16:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 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-07-12 19:16:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:48,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:48,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:48,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2022-07-12 19:16:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:48,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158931266] [2022-07-12 19:16:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:48,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:48,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158931266] [2022-07-12 19:16:48,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158931266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:48,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:48,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316273762] [2022-07-12 19:16:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:48,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:48,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:48,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:48,839 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:48,958 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-07-12 19:16:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:16:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:48,971 INFO L225 Difference]: With dead ends: 117 [2022-07-12 19:16:48,971 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:16:48,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-12 19:16:48,984 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:48,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:16:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 19:16:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 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-07-12 19:16:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-07-12 19:16:49,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2022-07-12 19:16:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:49,024 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-07-12 19:16:49,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-07-12 19:16:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:49,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:49,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:49,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:16:49,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2022-07-12 19:16:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:49,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126816381] [2022-07-12 19:16:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:49,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126816381] [2022-07-12 19:16:49,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126816381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:49,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:49,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:49,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777957301] [2022-07-12 19:16:49,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:49,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:49,123 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:49,203 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-12 19:16:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:49,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:16:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:49,208 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:16:49,208 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:16:49,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-12 19:16:49,212 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:49,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:16:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 19:16:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 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-07-12 19:16:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-07-12 19:16:49,229 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2022-07-12 19:16:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:49,230 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-07-12 19:16:49,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-07-12 19:16:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:16:49,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:49,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:49,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:16:49,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2022-07-12 19:16:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536248527] [2022-07-12 19:16:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536248527] [2022-07-12 19:16:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536248527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:49,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:49,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44513740] [2022-07-12 19:16:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:49,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:49,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:49,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:49,300 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:16:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:49,377 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-07-12 19:16:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-12 19:16:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:49,381 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:16:49,382 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:16:49,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:49,383 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:49,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 275 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:16:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-07-12 19:16:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 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-07-12 19:16:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2022-07-12 19:16:49,403 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2022-07-12 19:16:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:49,404 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2022-07-12 19:16:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:16:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-07-12 19:16:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:49,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:49,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:49,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:16:49,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2022-07-12 19:16:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060126563] [2022-07-12 19:16:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:49,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060126563] [2022-07-12 19:16:49,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060126563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:49,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:49,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265498530] [2022-07-12 19:16:49,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:49,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:49,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:49,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:49,543 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:49,744 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-12 19:16:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:49,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:16:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:49,747 INFO L225 Difference]: With dead ends: 113 [2022-07-12 19:16:49,748 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 19:16:49,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:49,754 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:49,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 387 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 19:16:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-07-12 19:16:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 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-07-12 19:16:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-07-12 19:16:49,770 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2022-07-12 19:16:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:49,770 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-07-12 19:16:49,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-07-12 19:16:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:49,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:49,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:49,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:16:49,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2022-07-12 19:16:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:49,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529420065] [2022-07-12 19:16:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:49,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529420065] [2022-07-12 19:16:49,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529420065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:49,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:49,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270129044] [2022-07-12 19:16:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:49,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:49,901 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:50,089 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-07-12 19:16:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:16:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:50,091 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:16:50,091 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:16:50,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:50,092 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:50,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 411 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:16:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-07-12 19:16:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 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-07-12 19:16:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-07-12 19:16:50,095 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2022-07-12 19:16:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:50,095 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-07-12 19:16:50,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-07-12 19:16:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:50,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:50,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:50,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:16:50,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2022-07-12 19:16:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:50,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773999637] [2022-07-12 19:16:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:16:50,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:50,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773999637] [2022-07-12 19:16:50,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773999637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:50,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026108797] [2022-07-12 19:16:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:50,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:50,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:16:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:50,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:16:50,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:50,382 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-07-12 19:16:50,517 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:50,517 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 18 [2022-07-12 19:16:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:50,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026108797] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:50,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:16:50,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-12 19:16:50,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018057244] [2022-07-12 19:16:50,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:50,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:16:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:16:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:16:50,768 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:51,019 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-07-12 19:16:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-12 19:16:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:51,020 INFO L225 Difference]: With dead ends: 117 [2022-07-12 19:16:51,020 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 19:16:51,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:16:51,021 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:51,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 839 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 184 Unchecked, 0.2s Time] [2022-07-12 19:16:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 19:16:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-12 19:16:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 111 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2022-07-12 19:16:51,025 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 25 [2022-07-12 19:16:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:51,025 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2022-07-12 19:16:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2022-07-12 19:16:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:51,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:51,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:51,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:51,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 19:16:51,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2022-07-12 19:16:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:51,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561792262] [2022-07-12 19:16:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561792262] [2022-07-12 19:16:51,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561792262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728339769] [2022-07-12 19:16:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:51,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:51,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:51,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:51,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:16:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 19:16:51,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:51,560 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-07-12 19:16:51,751 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:51,751 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 11 [2022-07-12 19:16:51,756 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 16 treesize of output 11 [2022-07-12 19:16:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:51,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:53,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728339769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:53,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:53,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-12 19:16:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311027510] [2022-07-12 19:16:53,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:53,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 19:16:53,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:53,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 19:16:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:16:53,945 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:16:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:54,419 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-07-12 19:16:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:54,420 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-12 19:16:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:54,420 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:16:54,420 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 19:16:54,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:16:54,421 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 210 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:54,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 697 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:16:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 19:16:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-07-12 19:16:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-07-12 19:16:54,425 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 25 [2022-07-12 19:16:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:54,425 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-07-12 19:16:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:16:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-07-12 19:16:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:54,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:54,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:54,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:54,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 19:16:54,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2022-07-12 19:16:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:54,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892130687] [2022-07-12 19:16:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:54,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892130687] [2022-07-12 19:16:54,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892130687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:54,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590675510] [2022-07-12 19:16:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:54,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:54,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:54,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:54,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:16:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:16:54,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:54,956 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-07-12 19:16:54,963 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-07-12 19:16:55,036 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-07-12 19:16:55,173 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:55,173 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-07-12 19:16:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:55,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:55,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590675510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:55,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:55,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-07-12 19:16:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932086318] [2022-07-12 19:16:55,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:55,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:16:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:16:55,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:16:55,301 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:55,519 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-07-12 19:16:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-12 19:16:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:55,520 INFO L225 Difference]: With dead ends: 140 [2022-07-12 19:16:55,520 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 19:16:55,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:16:55,521 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:55,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 302 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 268 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-07-12 19:16:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 19:16:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2022-07-12 19:16:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 112 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2022-07-12 19:16:55,525 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 37 [2022-07-12 19:16:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:55,525 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2022-07-12 19:16:55,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-07-12 19:16:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:55,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:55,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:55,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:55,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:55,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:55,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2022-07-12 19:16:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:55,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790463434] [2022-07-12 19:16:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:55,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:55,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:55,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:55,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790463434] [2022-07-12 19:16:55,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790463434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:55,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684095196] [2022-07-12 19:16:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:55,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:55,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:55,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:55,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:16:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:56,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:16:56,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:56,088 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-07-12 19:16:56,107 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-07-12 19:16:56,225 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 19:16:56,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:56,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:56,432 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 67291 column 46: unknown constant v_#length_BEFORE_CALL_4 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:248) 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:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-07-12 19:16:56,436 INFO L158 Benchmark]: Toolchain (without parser) took 8877.08ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 62.3MB in the beginning and 112.6MB in the end (delta: -50.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-07-12 19:16:56,436 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:16:56,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.67ms. Allocated memory is still 94.4MB. Free memory was 62.1MB in the beginning and 62.7MB in the end (delta: -663.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 19:16:56,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.96ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 60.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:16:56,436 INFO L158 Benchmark]: Boogie Preprocessor took 58.19ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 58.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:16:56,437 INFO L158 Benchmark]: RCFGBuilder took 453.30ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 58.5MB in the beginning and 90.2MB in the end (delta: -31.7MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-07-12 19:16:56,437 INFO L158 Benchmark]: TraceAbstraction took 7922.47ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 89.3MB in the beginning and 112.6MB in the end (delta: -23.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-07-12 19:16:56,438 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.15ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.67ms. Allocated memory is still 94.4MB. Free memory was 62.1MB in the beginning and 62.7MB in the end (delta: -663.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.96ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 60.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.19ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 58.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.30ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 58.5MB in the beginning and 90.2MB in the end (delta: -31.7MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7922.47ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 89.3MB in the beginning and 112.6MB in the end (delta: -23.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 67291 column 46: unknown constant v_#length_BEFORE_CALL_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 67291 column 46: unknown constant v_#length_BEFORE_CALL_4: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 19:16:56,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:16:58,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:16:58,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:16:58,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:16:58,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:16:58,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:16:58,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:16:58,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:16:58,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:16:58,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:16:58,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:16:58,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:16:58,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:16:58,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:16:58,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:16:58,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:16:58,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:16:58,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:16:58,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:16:58,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:16:58,238 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:16:58,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:16:58,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:16:58,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:16:58,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:16:58,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:16:58,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:16:58,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:16:58,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:16:58,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:16:58,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:16:58,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:16:58,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:16:58,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:16:58,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:16:58,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:16:58,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:16:58,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:16:58,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:16:58,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:16:58,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:16:58,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:16:58,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:16:58,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:16:58,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:16:58,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:16:58,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:16:58,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:16:58,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:16:58,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:16:58,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:16:58,288 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:16:58,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:16:58,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:16:58,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:16:58,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:16:58,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:16:58,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:16:58,290 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:16:58,290 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:16:58,290 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:16:58,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:16:58,291 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:16:58,291 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:16:58,291 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:16:58,291 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:16:58,291 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:16:58,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:16:58,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:16:58,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:16:58,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:58,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:16:58,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:16:58,292 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:16:58,293 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:16:58,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:16:58,293 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-07-12 19:16:58,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:16:58,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:16:58,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:16:58,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:16:58,625 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:16:58,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-12 19:16:58,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eb1ddc9/82c88fd3c6ba4493aa43aea202e9811b/FLAG53851b79c [2022-07-12 19:16:59,148 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:16:59,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-12 19:16:59,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eb1ddc9/82c88fd3c6ba4493aa43aea202e9811b/FLAG53851b79c [2022-07-12 19:16:59,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eb1ddc9/82c88fd3c6ba4493aa43aea202e9811b [2022-07-12 19:16:59,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:16:59,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:16:59,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:59,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:16:59,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:16:59,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4746f5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59, skipping insertion in model container [2022-07-12 19:16:59,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:16:59,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:16:59,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-07-12 19:16:59,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:59,773 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:16:59,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-07-12 19:16:59,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:59,844 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:16:59,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59 WrapperNode [2022-07-12 19:16:59,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:59,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:59,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:16:59,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:16:59,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,894 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 144 [2022-07-12 19:16:59,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:59,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:16:59,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:16:59,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:16:59,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:16:59,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:16:59,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:16:59,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:16:59,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (1/1) ... [2022-07-12 19:16:59,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:59,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:59,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:16:59,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:16:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:16:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:16:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:16:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:16:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:16:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:16:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:16:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:17:00,114 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:17:00,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:17:00,560 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:17:00,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:17:00,568 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 19:17:00,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:17:00 BoogieIcfgContainer [2022-07-12 19:17:00,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:17:00,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:17:00,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:17:00,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:17:00,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:16:59" (1/3) ... [2022-07-12 19:17:00,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164eb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:17:00, skipping insertion in model container [2022-07-12 19:17:00,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:59" (2/3) ... [2022-07-12 19:17:00,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164eb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:17:00, skipping insertion in model container [2022-07-12 19:17:00,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:17:00" (3/3) ... [2022-07-12 19:17:00,577 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-07-12 19:17:00,591 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:17:00,591 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-07-12 19:17:00,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:17:00,639 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c2cbc28, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43e18778 [2022-07-12 19:17:00,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-07-12 19:17:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 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-07-12 19:17:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:17:00,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:00,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:17:00,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2022-07-12 19:17:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255010542] [2022-07-12 19:17:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:00,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:00,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:00,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:00,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 19:17:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:00,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:17:00,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:00,778 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-07-12 19:17:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:00,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:00,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:00,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255010542] [2022-07-12 19:17:00,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255010542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:00,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:00,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:00,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119584603] [2022-07-12 19:17:00,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:00,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:00,811 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:00,967 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-07-12 19:17:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:00,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:17:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:00,981 INFO L225 Difference]: With dead ends: 117 [2022-07-12 19:17:00,981 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:17:00,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-12 19:17:00,985 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:00,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:17:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 19:17:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 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-07-12 19:17:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-07-12 19:17:01,022 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2022-07-12 19:17:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:01,022 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-07-12 19:17:01,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-07-12 19:17:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:17:01,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:01,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:17:01,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 19:17:01,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:01,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2022-07-12 19:17:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197440437] [2022-07-12 19:17:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:01,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:01,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:01,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:01,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 19:17:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:01,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:01,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:01,300 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-07-12 19:17:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:01,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:01,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:01,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197440437] [2022-07-12 19:17:01,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197440437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:01,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:01,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566173966] [2022-07-12 19:17:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:01,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:01,332 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:01,505 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-12 19:17:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:17:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:01,510 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:17:01,510 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:17:01,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-12 19:17:01,511 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:01,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:17:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 19:17:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 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-07-12 19:17:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-07-12 19:17:01,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2022-07-12 19:17:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:01,518 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-07-12 19:17:01,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-07-12 19:17:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:17:01,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:01,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:01,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:01,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:01,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2022-07-12 19:17:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:01,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100146180] [2022-07-12 19:17:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:01,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:01,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 19:17:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:01,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:01,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:01,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:01,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100146180] [2022-07-12 19:17:01,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100146180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:01,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:01,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:17:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721585345] [2022-07-12 19:17:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:01,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:01,881 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:17:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:01,889 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-07-12 19:17:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-12 19:17:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:01,898 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:17:01,899 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:17:01,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-07-12 19:17:01,900 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 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-07-12 19:17:01,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:17:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:17:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-07-12 19:17:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 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-07-12 19:17:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2022-07-12 19:17:01,911 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2022-07-12 19:17:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:01,912 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2022-07-12 19:17:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:17:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-07-12 19:17:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:17:01,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:01,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:01,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 19:17:02,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:02,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:02,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:02,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2022-07-12 19:17:02,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:02,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157010294] [2022-07-12 19:17:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:02,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:02,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:02,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 19:17:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:02,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:17:02,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:02,220 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-07-12 19:17:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:02,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:02,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:02,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157010294] [2022-07-12 19:17:02,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157010294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:02,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:02,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451673446] [2022-07-12 19:17:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:02,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:02,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:02,251 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:02,535 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-12 19:17:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:02,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:17:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:02,538 INFO L225 Difference]: With dead ends: 113 [2022-07-12 19:17:02,538 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 19:17:02,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:02,538 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:02,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 349 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 19:17:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-07-12 19:17:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 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-07-12 19:17:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-07-12 19:17:02,552 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2022-07-12 19:17:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:02,552 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-07-12 19:17:02,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-07-12 19:17:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:17:02,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:02,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:02,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 19:17:02,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:02,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:02,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2022-07-12 19:17:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:02,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124332869] [2022-07-12 19:17:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:02,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:02,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:02,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 19:17:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:02,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:17:02,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:02,882 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-07-12 19:17:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:02,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:02,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124332869] [2022-07-12 19:17:02,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124332869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:02,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:02,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4651035] [2022-07-12 19:17:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:02,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:02,963 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:03,269 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-07-12 19:17:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:17:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:03,271 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:17:03,271 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:17:03,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:03,272 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:03,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 373 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:17:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-07-12 19:17:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 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-07-12 19:17:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-07-12 19:17:03,276 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2022-07-12 19:17:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:03,276 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-07-12 19:17:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-07-12 19:17:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:17:03,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:03,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:03,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:03,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:03,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:03,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2022-07-12 19:17:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:03,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633088087] [2022-07-12 19:17:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:03,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:03,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 19:17:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:03,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:17:03,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:03,578 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-07-12 19:17:03,683 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:03,684 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 18 treesize of output 25 [2022-07-12 19:17:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:03,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:03,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633088087] [2022-07-12 19:17:03,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633088087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:03,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:03,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-12 19:17:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819675667] [2022-07-12 19:17:03,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:03,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:17:03,871 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:04,161 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-07-12 19:17:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:04,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-12 19:17:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:04,163 INFO L225 Difference]: With dead ends: 117 [2022-07-12 19:17:04,163 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 19:17:04,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:17:04,164 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:04,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 398 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-07-12 19:17:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 19:17:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-12 19:17:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 111 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2022-07-12 19:17:04,168 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 25 [2022-07-12 19:17:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:04,169 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2022-07-12 19:17:04,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2022-07-12 19:17:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:17:04,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:04,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:04,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:04,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:04,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2022-07-12 19:17:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:04,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272531923] [2022-07-12 19:17:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:04,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:04,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 19:17:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:04,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:17:04,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:04,483 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-07-12 19:17:04,487 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-07-12 19:17:04,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:04,659 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 14 [2022-07-12 19:17:04,666 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:04,666 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 12 treesize of output 12 [2022-07-12 19:17:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:04,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:07,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:07,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272531923] [2022-07-12 19:17:07,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272531923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:07,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [658922756] [2022-07-12 19:17:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:07,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:07,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:07,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-12 19:17:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:17:07,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:07,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 5 [2022-07-12 19:17:07,285 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-07-12 19:17:07,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:07,387 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 14 [2022-07-12 19:17:07,393 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:07,393 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 12 treesize of output 12 [2022-07-12 19:17:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:07,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:07,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [658922756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:07,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:07,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 19:17:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369996175] [2022-07-12 19:17:07,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:07,528 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 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-07-12 19:17:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:08,020 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-07-12 19:17:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:17:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 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-07-12 19:17:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:08,021 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:17:08,021 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:17:08,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:17:08,022 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:08,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 440 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 389 Invalid, 0 Unknown, 74 Unchecked, 0.4s Time] [2022-07-12 19:17:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:17:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2022-07-12 19:17:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 116 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:17:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2022-07-12 19:17:08,026 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 25 [2022-07-12 19:17:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:08,026 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2022-07-12 19:17:08,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 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-07-12 19:17:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2022-07-12 19:17:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:08,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:08,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:08,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-12 19:17:08,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 19:17:08,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:08,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2022-07-12 19:17:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:08,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376155599] [2022-07-12 19:17:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:08,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:08,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:08,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 19:17:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:08,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:17:08,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:08,607 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-07-12 19:17:08,620 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-07-12 19:17:08,709 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:08,709 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 18 treesize of output 25 [2022-07-12 19:17:08,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 5 treesize of output 3 [2022-07-12 19:17:08,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:08,786 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 14 [2022-07-12 19:17:08,938 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:17:08,938 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 17 [2022-07-12 19:17:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:08,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:09,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:09,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376155599] [2022-07-12 19:17:09,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376155599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:09,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1509017142] [2022-07-12 19:17:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,147 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:09,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:09,148 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:09,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-12 19:17:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:17:09,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:09,384 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:17:09,384 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 17 [2022-07-12 19:17:09,416 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:09,416 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 13 treesize of output 9 [2022-07-12 19:17:09,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:09,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:09,484 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:17:09,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 31 [2022-07-12 19:17:09,546 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:09,546 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 22 treesize of output 18 [2022-07-12 19:17:09,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:09,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:09,642 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:17:09,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 40 [2022-07-12 19:17:09,795 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:09,796 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 22 treesize of output 18 [2022-07-12 19:17:09,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:09,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:09,865 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:17:09,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 40 [2022-07-12 19:17:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:17:09,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:09,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1509017142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:09,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:17:09,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 19:17:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735717015] [2022-07-12 19:17:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:09,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:17:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:17:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:17:09,960 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:10,276 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-07-12 19:17:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:17:10,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:17:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:10,278 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:17:10,278 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:17:10,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:17:10,278 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:10,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 425 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2022-07-12 19:17:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:17:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-07-12 19:17:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 115 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:17:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-07-12 19:17:10,282 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 37 [2022-07-12 19:17:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:10,282 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-07-12 19:17:10,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-07-12 19:17:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:10,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:10,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:10,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-12 19:17:10,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 19:17:10,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:10,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2022-07-12 19:17:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:10,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242549213] [2022-07-12 19:17:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:10,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:10,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:10,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:10,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 19:17:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:17:10,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:10,850 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-07-12 19:17:10,859 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-07-12 19:17:10,871 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-07-12 19:17:10,874 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-07-12 19:17:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,967 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 14 [2022-07-12 19:17:12,984 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:12,984 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 12 treesize of output 12 [2022-07-12 19:17:13,024 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-07-12 19:17:15,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:15,112 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 14 [2022-07-12 19:17:15,321 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:15,321 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 18 [2022-07-12 19:17:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:15,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:15,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:15,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242549213] [2022-07-12 19:17:15,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242549213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:15,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [890081073] [2022-07-12 19:17:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:15,642 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:15,644 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:15,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-12 19:17:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:15,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:17:15,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:15,898 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-07-12 19:17:15,906 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-07-12 19:17:16,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:16,011 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 14 [2022-07-12 19:17:16,080 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-07-12 19:17:18,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:18,192 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 14 [2022-07-12 19:17:18,305 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-07-12 19:17:18,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:18,389 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 14 [2022-07-12 19:17:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:17:18,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:18,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [890081073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:18,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:17:18,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-07-12 19:17:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934007571] [2022-07-12 19:17:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:18,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2022-07-12 19:17:18,411 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:18,790 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-07-12 19:17:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:18,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:17:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:18,791 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:17:18,791 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:17:18,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-07-12 19:17:18,792 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:18,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 389 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2022-07-12 19:17:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:17:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-12 19:17:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 114 states have internal predecessors, (122), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:17:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-07-12 19:17:18,795 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 37 [2022-07-12 19:17:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:18,796 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-07-12 19:17:18,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-07-12 19:17:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:18,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:18,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:18,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:19,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:19,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:19,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1212309452, now seen corresponding path program 2 times [2022-07-12 19:17:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:19,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093044827] [2022-07-12 19:17:19,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:17:19,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:19,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:19,211 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:19,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 19:17:19,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:17:19,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:17:19,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:19,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:17:19,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:17:19,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:19,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093044827] [2022-07-12 19:17:19,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093044827] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:19,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:19,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 19:17:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886301036] [2022-07-12 19:17:19,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:19,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:19,418 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:17:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:19,439 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-12 19:17:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:17:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-12 19:17:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:19,441 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:17:19,441 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:17:19,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:19,442 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 95 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:19,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 251 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:17:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:17:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 19:17:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 108 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-07-12 19:17:19,447 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37 [2022-07-12 19:17:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:19,448 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-07-12 19:17:19,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:17:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-07-12 19:17:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:17:19,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:19,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-12 19:17:19,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:19,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:19,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1664104416, now seen corresponding path program 1 times [2022-07-12 19:17:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532594664] [2022-07-12 19:17:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:19,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:19,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 19:17:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:19,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:17:19,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:19,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:19,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:19,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532594664] [2022-07-12 19:17:19,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532594664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:19,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:19,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:19,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673702387] [2022-07-12 19:17:19,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:19,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:19,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:19,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:19,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:19,786 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:19,910 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2022-07-12 19:17:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:19,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-12 19:17:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:19,911 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:17:19,911 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:17:19,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-07-12 19:17:19,912 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 79 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:19,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 98 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:17:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2022-07-12 19:17:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.626865671641791) internal successors, (109), 103 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2022-07-12 19:17:19,914 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 39 [2022-07-12 19:17:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2022-07-12 19:17:19,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-07-12 19:17:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:17:19,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:19,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-12 19:17:19,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:20,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:20,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1664104415, now seen corresponding path program 1 times [2022-07-12 19:17:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:20,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769957409] [2022-07-12 19:17:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:20,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:20,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:20,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:20,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 19:17:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:20,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:20,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:20,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:20,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769957409] [2022-07-12 19:17:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769957409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999770797] [2022-07-12 19:17:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:17:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:17:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:17:20,315 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-07-12 19:17:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:20,479 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-12 19:17:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-12 19:17:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:20,480 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:17:20,480 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:17:20,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:20,481 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 160 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:20,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 120 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:17:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 19:17:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2022-07-12 19:17:20,483 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 39 [2022-07-12 19:17:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:20,484 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2022-07-12 19:17:20,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-07-12 19:17:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-07-12 19:17:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:17:20,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:20,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-12 19:17:20,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:20,692 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash -47629334, now seen corresponding path program 1 times [2022-07-12 19:17:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:20,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97788541] [2022-07-12 19:17:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:20,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:20,694 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:20,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:17:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:20,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:17:20,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:20,841 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-07-12 19:17:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:17:20,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:20,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:20,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97788541] [2022-07-12 19:17:20,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97788541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:20,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:20,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025908441] [2022-07-12 19:17:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:20,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:20,874 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:21,173 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-07-12 19:17:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:21,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-12 19:17:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:21,174 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:17:21,174 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:17:21,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:21,175 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:21,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 240 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:17:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2022-07-12 19:17:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-12 19:17:21,178 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 40 [2022-07-12 19:17:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:21,178 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-12 19:17:21,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-12 19:17:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:17:21,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:21,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-12 19:17:21,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:21,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:21,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -47629333, now seen corresponding path program 1 times [2022-07-12 19:17:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:21,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976796440] [2022-07-12 19:17:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:21,390 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 19:17:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:21,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:17:21,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:21,534 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-07-12 19:17:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:17:21,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:21,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976796440] [2022-07-12 19:17:21,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976796440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:21,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:21,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065822984] [2022-07-12 19:17:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:21,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:21,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:21,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:21,602 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:21,943 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-12 19:17:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:21,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-12 19:17:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:21,944 INFO L225 Difference]: With dead ends: 100 [2022-07-12 19:17:21,944 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 19:17:21,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:21,945 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 75 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:21,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 251 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 19:17:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 19:17:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.492537313432836) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-12 19:17:21,947 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 40 [2022-07-12 19:17:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:21,947 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-12 19:17:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-12 19:17:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:21,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:21,948 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 19:17:21,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-12 19:17:22,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:22,148 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263067, now seen corresponding path program 1 times [2022-07-12 19:17:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:22,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898841907] [2022-07-12 19:17:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:22,150 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:22,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:17:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:22,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:17:22,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:22,368 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-07-12 19:17:22,476 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-07-12 19:17:22,536 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 12 treesize of output 8 [2022-07-12 19:17:22,762 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:17:22,762 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 25 treesize of output 36 [2022-07-12 19:17:22,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:22,773 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 27 treesize of output 27 [2022-07-12 19:17:22,885 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 28 treesize of output 16 [2022-07-12 19:17:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:22,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:23,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898841907] [2022-07-12 19:17:23,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898841907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946821309] [2022-07-12 19:17:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:23,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:23,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:23,171 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:23,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-12 19:17:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:23,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:17:23,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:23,497 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-07-12 19:17:23,822 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 12 treesize of output 8 [2022-07-12 19:17:24,025 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:17:24,025 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 25 treesize of output 36 [2022-07-12 19:17:24,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:24,038 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 28 treesize of output 28 [2022-07-12 19:17:24,175 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 29 treesize of output 17 [2022-07-12 19:17:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:24,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:24,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946821309] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:24,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:24,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2022-07-12 19:17:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785691913] [2022-07-12 19:17:24,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:24,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 19:17:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 19:17:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=704, Unknown=5, NotChecked=0, Total=812 [2022-07-12 19:17:24,348 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 27 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:24,886 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-07-12 19:17:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:17:24,887 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-12 19:17:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:24,889 INFO L225 Difference]: With dead ends: 160 [2022-07-12 19:17:24,889 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 19:17:24,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=1088, Unknown=9, NotChecked=0, Total=1260 [2022-07-12 19:17:24,890 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:24,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 579 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 367 Unchecked, 0.3s Time] [2022-07-12 19:17:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 19:17:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 109. [2022-07-12 19:17:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.486842105263158) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2022-07-12 19:17:24,893 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 41 [2022-07-12 19:17:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:24,893 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2022-07-12 19:17:24,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2022-07-12 19:17:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:24,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:24,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-12 19:17:24,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:25,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:25,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:25,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263066, now seen corresponding path program 1 times [2022-07-12 19:17:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:25,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378170260] [2022-07-12 19:17:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:25,299 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:25,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:17:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:25,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:17:25,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:25,514 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-07-12 19:17:25,518 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-07-12 19:17:25,706 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-07-12 19:17:25,814 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 22 treesize of output 14 [2022-07-12 19:17:25,820 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-07-12 19:17:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:26,107 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-07-12 19:17:26,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:26,120 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 28 treesize of output 28 [2022-07-12 19:17:26,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:26,129 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 16 treesize of output 18 [2022-07-12 19:17:26,144 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:26,145 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 19 treesize of output 19 [2022-07-12 19:17:26,263 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-07-12 19:17:26,268 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 25 treesize of output 13 [2022-07-12 19:17:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:26,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:27,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378170260] [2022-07-12 19:17:27,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378170260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [481962855] [2022-07-12 19:17:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:27,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:27,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:27,064 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:27,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-07-12 19:17:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:27,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:17:27,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:27,468 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-07-12 19:17:27,474 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-07-12 19:17:27,974 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 22 treesize of output 14 [2022-07-12 19:17:27,980 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-07-12 19:17:28,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:28,173 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-07-12 19:17:28,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:28,184 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 28 treesize of output 28 [2022-07-12 19:17:28,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:28,194 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 16 treesize of output 18 [2022-07-12 19:17:28,208 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:28,208 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 19 treesize of output 19 [2022-07-12 19:17:28,371 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 25 treesize of output 13 [2022-07-12 19:17:28,378 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-07-12 19:17:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:28,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:28,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [481962855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:28,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:28,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-07-12 19:17:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053385775] [2022-07-12 19:17:28,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:28,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:17:28,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:28,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:17:28,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=761, Unknown=4, NotChecked=0, Total=870 [2022-07-12 19:17:28,902 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:30,161 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2022-07-12 19:17:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:17:30,166 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-12 19:17:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:30,167 INFO L225 Difference]: With dead ends: 159 [2022-07-12 19:17:30,167 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 19:17:30,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=166, Invalid=1158, Unknown=8, NotChecked=0, Total=1332 [2022-07-12 19:17:30,168 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 87 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:30,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 998 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 588 Invalid, 0 Unknown, 181 Unchecked, 0.8s Time] [2022-07-12 19:17:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 19:17:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2022-07-12 19:17:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-07-12 19:17:30,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 41 [2022-07-12 19:17:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:30,174 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-07-12 19:17:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-07-12 19:17:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:17:30,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:30,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-12 19:17:30,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:30,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-12 19:17:30,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:30,579 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1472852043, now seen corresponding path program 1 times [2022-07-12 19:17:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:30,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579459760] [2022-07-12 19:17:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:30,586 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:30,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:17:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:30,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:30,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:30,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:30,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579459760] [2022-07-12 19:17:30,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579459760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:30,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:30,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:17:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529003653] [2022-07-12 19:17:30,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:30,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:17:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:30,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:17:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:30,747 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-07-12 19:17:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:30,870 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2022-07-12 19:17:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:17:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 42 [2022-07-12 19:17:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:30,871 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:17:30,871 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:17:30,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-07-12 19:17:30,871 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 151 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:30,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 109 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:17:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2022-07-12 19:17:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 100 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-12 19:17:30,874 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 42 [2022-07-12 19:17:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:30,875 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-12 19:17:30,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-07-12 19:17:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-12 19:17:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:17:30,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:30,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-12 19:17:30,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:31,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:31,086 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1472852044, now seen corresponding path program 1 times [2022-07-12 19:17:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:31,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100388109] [2022-07-12 19:17:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:31,088 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:31,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:17:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:31,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:17:31,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:31,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:31,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:31,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100388109] [2022-07-12 19:17:31,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100388109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:31,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924576024] [2022-07-12 19:17:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:17:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:17:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:17:31,301 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-07-12 19:17:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:31,449 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-07-12 19:17:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:31,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 42 [2022-07-12 19:17:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:31,450 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:17:31,450 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:17:31,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:31,451 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 138 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:31,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:17:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-12 19:17:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.368421052631579) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-07-12 19:17:31,454 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 42 [2022-07-12 19:17:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:31,454 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-07-12 19:17:31,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-07-12 19:17:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-07-12 19:17:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:17:31,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:31,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:31,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-12 19:17:31,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:31,663 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1928392465, now seen corresponding path program 1 times [2022-07-12 19:17:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:31,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556402869] [2022-07-12 19:17:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:31,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:31,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:31,664 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:31,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:17:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:31,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 19:17:31,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:31,951 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-07-12 19:17:32,004 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-07-12 19:17:32,141 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-12 19:17:32,147 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-07-12 19:17:32,240 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 20 treesize of output 12 [2022-07-12 19:17:32,328 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-07-12 19:17:32,365 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-07-12 19:17:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:32,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:32,455 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 34 [2022-07-12 19:17:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-12 19:17:32,755 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_node_create_~temp~0#1.base_58|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_58| v_ArrVal_1254) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (_ bv0 32))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (forall ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_58| v_ArrVal_1254) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (_ bv0 32)))))) is different from false [2022-07-12 19:17:32,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556402869] [2022-07-12 19:17:32,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556402869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1762864042] [2022-07-12 19:17:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:32,757 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:32,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:32,758 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:32,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-12 19:17:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:33,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:17:33,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:33,448 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-07-12 19:17:33,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:33,700 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-07-12 19:17:33,784 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-07-12 19:17:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:33,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:33,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1762864042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:33,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:33,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2022-07-12 19:17:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841968613] [2022-07-12 19:17:33,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:33,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 19:17:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 19:17:33,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1653, Unknown=7, NotChecked=82, Total=1892 [2022-07-12 19:17:33,938 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 36 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 31 states have internal predecessors, (75), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:35,112 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-07-12 19:17:35,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:17:35,112 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 31 states have internal predecessors, (75), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-07-12 19:17:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:35,113 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:17:35,113 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:17:35,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=250, Invalid=2604, Unknown=12, NotChecked=104, Total=2970 [2022-07-12 19:17:35,114 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 82 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:35,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1387 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 558 Invalid, 0 Unknown, 152 Unchecked, 0.7s Time] [2022-07-12 19:17:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:17:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-07-12 19:17:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-12 19:17:35,120 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 44 [2022-07-12 19:17:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:35,120 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-12 19:17:35,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 31 states have internal predecessors, (75), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-12 19:17:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:17:35,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:35,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:35,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-12 19:17:35,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-12 19:17:35,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:35,521 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash -710984888, now seen corresponding path program 1 times [2022-07-12 19:17:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:35,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932260588] [2022-07-12 19:17:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:35,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:35,523 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:35,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:17:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:35,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 19:17:35,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:35,780 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-07-12 19:17:35,935 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:35,936 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 21 treesize of output 28 [2022-07-12 19:17:36,027 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-07-12 19:17:36,136 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:36,137 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 41 treesize of output 40 [2022-07-12 19:17:36,294 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:17:36,294 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 35 [2022-07-12 19:17:36,299 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 13 treesize of output 9 [2022-07-12 19:17:36,305 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-07-12 19:17:36,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:36,603 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:17:36,603 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 57 treesize of output 55 [2022-07-12 19:17:36,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:36,614 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 48 treesize of output 48 [2022-07-12 19:17:36,659 INFO L356 Elim1Store]: treesize reduction 78, result has 42.2 percent of original size [2022-07-12 19:17:36,659 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 4 case distinctions, treesize of input 43 treesize of output 76 [2022-07-12 19:17:36,855 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 64 treesize of output 48 [2022-07-12 19:17:37,195 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-12 19:17:37,195 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 74 treesize of output 42 [2022-07-12 19:17:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:37,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:37,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:37,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932260588] [2022-07-12 19:17:37,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932260588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:37,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1766084703] [2022-07-12 19:17:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:37,759 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:37,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:37,760 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:37,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-12 19:17:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:38,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 19:17:38,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:38,138 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-07-12 19:17:38,479 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:38,480 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 21 treesize of output 28 [2022-07-12 19:17:38,695 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-07-12 19:17:38,949 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:38,949 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 41 treesize of output 40 [2022-07-12 19:17:39,246 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:39,247 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-07-12 19:17:39,252 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-07-12 19:17:39,257 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-07-12 19:17:39,499 INFO L356 Elim1Store]: treesize reduction 78, result has 42.2 percent of original size [2022-07-12 19:17:39,499 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 4 case distinctions, treesize of input 43 treesize of output 76 [2022-07-12 19:17:39,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:39,534 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:17:39,534 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 84 treesize of output 74 [2022-07-12 19:17:39,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:39,552 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 72 treesize of output 68 [2022-07-12 19:17:39,812 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 73 treesize of output 53 [2022-07-12 19:17:40,254 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:40,254 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 77 treesize of output 40 [2022-07-12 19:17:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:40,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:40,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1766084703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:40,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:40,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 41 [2022-07-12 19:17:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256485917] [2022-07-12 19:17:40,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:40,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 19:17:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:40,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 19:17:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2055, Unknown=7, NotChecked=0, Total=2256 [2022-07-12 19:17:40,591 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 42 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:41,651 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-12 19:17:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:17:41,651 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:17:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:41,652 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:17:41,652 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:17:41,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=271, Invalid=2689, Unknown=10, NotChecked=0, Total=2970 [2022-07-12 19:17:41,653 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 25 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:41,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 556 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 271 Unchecked, 0.4s Time] [2022-07-12 19:17:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:17:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 19:17:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.355263157894737) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-12 19:17:41,655 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 46 [2022-07-12 19:17:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:41,656 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-12 19:17:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-12 19:17:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:17:41,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:41,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:41,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:41,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:42,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:42,061 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash -710984887, now seen corresponding path program 1 times [2022-07-12 19:17:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:42,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117372629] [2022-07-12 19:17:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:42,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:42,063 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:42,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 19:17:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:42,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 19:17:42,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:42,381 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-07-12 19:17:42,386 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-07-12 19:17:42,703 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:42,703 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 21 treesize of output 28 [2022-07-12 19:17:42,724 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 14 [2022-07-12 19:17:42,862 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-07-12 19:17:42,870 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-07-12 19:17:43,057 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:43,058 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 59 treesize of output 54 [2022-07-12 19:17:43,063 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-07-12 19:17:43,314 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:17:43,315 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 84 treesize of output 52 [2022-07-12 19:17:43,325 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:17:43,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-12 19:17:43,332 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-07-12 19:17:43,338 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 16 treesize of output 12 [2022-07-12 19:17:43,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:43,702 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:17:43,702 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 90 treesize of output 80 [2022-07-12 19:17:43,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:43,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:43,734 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:17:43,734 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 78 treesize of output 77 [2022-07-12 19:17:43,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:43,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-07-12 19:17:43,772 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-12 19:17:43,772 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 38 treesize of output 40 [2022-07-12 19:17:44,279 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:17:44,279 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 107 treesize of output 59 [2022-07-12 19:17:44,290 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:17:44,290 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 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-12 19:17:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:44,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:45,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117372629] [2022-07-12 19:17:45,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117372629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1310120899] [2022-07-12 19:17:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:45,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:45,586 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-12 19:17:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:45,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 19:17:45,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:46,006 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-07-12 19:17:46,012 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-07-12 19:17:46,595 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:46,595 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 18 [2022-07-12 19:17:46,622 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:46,622 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 21 treesize of output 28 [2022-07-12 19:17:47,004 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-07-12 19:17:47,026 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-07-12 19:17:47,424 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:47,424 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 59 treesize of output 54 [2022-07-12 19:17:47,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, 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-07-12 19:17:47,943 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:47,943 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 85 treesize of output 44 [2022-07-12 19:17:47,950 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 19 treesize of output 10 [2022-07-12 19:17:47,955 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 17 treesize of output 13 [2022-07-12 19:17:48,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:48,231 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:17:48,231 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 91 treesize of output 81 [2022-07-12 19:17:48,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:48,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:48,248 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:17:48,248 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 85 treesize of output 82 [2022-07-12 19:17:48,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:48,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-07-12 19:17:48,279 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-12 19:17:48,280 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 39 treesize of output 41 [2022-07-12 19:17:51,302 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:51,303 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 107 treesize of output 50 [2022-07-12 19:17:51,314 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-12 19:17:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:51,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:51,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1310120899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:51,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:51,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 42 [2022-07-12 19:17:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269342091] [2022-07-12 19:17:51,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:51,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 19:17:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 19:17:51,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2153, Unknown=3, NotChecked=0, Total=2352 [2022-07-12 19:17:51,844 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 43 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:53,187 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-12 19:17:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:17:53,187 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:17:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:53,188 INFO L225 Difference]: With dead ends: 155 [2022-07-12 19:17:53,188 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 19:17:53,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=249, Invalid=2714, Unknown=7, NotChecked=0, Total=2970 [2022-07-12 19:17:53,189 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 75 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:53,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 812 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 401 Unchecked, 0.3s Time] [2022-07-12 19:17:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 19:17:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 110. [2022-07-12 19:17:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-07-12 19:17:53,198 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 46 [2022-07-12 19:17:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:53,198 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-07-12 19:17:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-07-12 19:17:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:17:53,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:53,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:53,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:53,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:53,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:53,604 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1827931507, now seen corresponding path program 1 times [2022-07-12 19:17:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:53,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442663989] [2022-07-12 19:17:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:53,605 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:53,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 19:17:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:53,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:17:53,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:17:53,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:53,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:53,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442663989] [2022-07-12 19:17:53,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442663989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:53,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:53,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019273641] [2022-07-12 19:17:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:53,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:53,796 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-07-12 19:17:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:53,921 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2022-07-12 19:17:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:53,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 49 [2022-07-12 19:17:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:53,922 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:17:53,922 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:17:53,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-07-12 19:17:53,922 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 50 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:53,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:17:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2022-07-12 19:17:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-07-12 19:17:53,924 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 49 [2022-07-12 19:17:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:53,925 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-07-12 19:17:53,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-07-12 19:17:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-07-12 19:17:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:17:53,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:53,926 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:53,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-12 19:17:54,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:54,133 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:54,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 555333, now seen corresponding path program 2 times [2022-07-12 19:17:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:54,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226497105] [2022-07-12 19:17:54,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:17:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:54,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:54,135 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 19:17:54,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:17:54,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:17:54,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 19:17:54,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:54,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:54,437 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 14 [2022-07-12 19:17:54,564 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:54,565 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 18 treesize of output 25 [2022-07-12 19:17:54,798 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-12 19:17:54,799 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 4 case distinctions, treesize of input 25 treesize of output 42 [2022-07-12 19:17:54,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-07-12 19:17:55,002 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 11 treesize of output 7 [2022-07-12 19:17:55,261 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 19:17:55,261 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 1 case distinctions, treesize of input 74 treesize of output 52 [2022-07-12 19:17:55,267 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 33 [2022-07-12 19:17:55,629 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-12 19:17:55,629 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 80 [2022-07-12 19:17:55,647 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 19:17:55,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-07-12 19:17:55,656 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 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-12 19:17:55,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:56,033 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 19:17:56,033 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 5 case distinctions, treesize of input 152 treesize of output 130 [2022-07-12 19:17:56,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:56,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:56,072 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-12 19:17:56,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 128 [2022-07-12 19:17:56,118 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-12 19:17:56,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2022-07-12 19:17:57,386 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-12 19:17:57,387 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 94 [2022-07-12 19:17:57,398 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 19:17:57,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 28 [2022-07-12 19:17:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:57,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:58,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:58,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226497105] [2022-07-12 19:17:58,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226497105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:58,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [565507922] [2022-07-12 19:17:58,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:17:58,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:58,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:58,407 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:58,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-07-12 19:17:58,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:17:58,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:17:58,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 19:17:58,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:58,926 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-07-12 19:17:59,671 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:59,671 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 21 treesize of output 28 [2022-07-12 19:18:00,025 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-07-12 19:18:00,052 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-07-12 19:18:00,465 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:18:00,465 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 59 treesize of output 41 [2022-07-12 19:18:00,472 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-07-12 19:18:01,058 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-12 19:18:01,059 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 44 [2022-07-12 19:18:01,065 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 19 treesize of output 10 [2022-07-12 19:18:01,070 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 16 treesize of output 12 [2022-07-12 19:18:01,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:01,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:01,710 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:18:01,711 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 91 treesize of output 88 [2022-07-12 19:18:01,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:01,750 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 19:18:01,750 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 5 case distinctions, treesize of input 96 treesize of output 90 [2022-07-12 19:18:01,801 INFO L356 Elim1Store]: treesize reduction 78, result has 42.2 percent of original size [2022-07-12 19:18:01,801 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 4 case distinctions, treesize of input 44 treesize of output 77 [2022-07-12 19:18:02,882 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 19:18:02,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 86 [2022-07-12 19:18:03,642 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-12 19:18:03,642 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 44 [2022-07-12 19:18:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:10,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [565507922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:11,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:11,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2022-07-12 19:18:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343369393] [2022-07-12 19:18:11,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:11,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 19:18:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 19:18:11,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=4819, Unknown=29, NotChecked=0, Total=5112 [2022-07-12 19:18:11,767 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 56 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:26,439 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-07-12 19:18:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:18:26,439 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-07-12 19:18:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:26,440 INFO L225 Difference]: With dead ends: 89 [2022-07-12 19:18:26,440 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 19:18:26,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2732 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=484, Invalid=8219, Unknown=39, NotChecked=0, Total=8742 [2022-07-12 19:18:26,442 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:26,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1498 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 704 Invalid, 0 Unknown, 380 Unchecked, 1.2s Time] [2022-07-12 19:18:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 19:18:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-12 19:18:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-07-12 19:18:26,450 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 51 [2022-07-12 19:18:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:26,450 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-07-12 19:18:26,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-07-12 19:18:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:18:26,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:26,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:26,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:26,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2022-07-12 19:18:26,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:26,860 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:18:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash 430095050, now seen corresponding path program 1 times [2022-07-12 19:18:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:26,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423382754] [2022-07-12 19:18:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:26,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:26,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:26,862 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:26,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 19:18:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:27,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 19:18:27,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:27,478 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-07-12 19:18:27,508 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-07-12 19:18:27,754 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:27,755 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 14 treesize of output 20 [2022-07-12 19:18:27,759 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-07-12 19:18:27,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:28,280 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-07-12 19:18:28,364 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:18:28,364 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 43 treesize of output 30 [2022-07-12 19:18:28,477 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:18:28,480 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 46 treesize of output 22 [2022-07-12 19:18:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:28,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:30,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (_ BitVec 32))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:18:30,724 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 78 treesize of output 74 [2022-07-12 19:18:31,186 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 17 treesize of output 15 [2022-07-12 19:18:31,195 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 17 treesize of output 15 [2022-07-12 19:18:31,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423382754] [2022-07-12 19:18:31,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423382754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1046647270] [2022-07-12 19:18:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:31,271 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:31,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:31,272 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:31,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-12 19:18:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:31,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 19:18:31,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:31,772 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-07-12 19:18:32,283 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:32,283 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 21 treesize of output 28 [2022-07-12 19:18:32,579 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-07-12 19:18:32,893 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:32,894 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 31 treesize of output 32 [2022-07-12 19:18:33,318 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:33,319 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 53 treesize of output 28 [2022-07-12 19:18:33,326 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 17 treesize of output 13 [2022-07-12 19:18:33,333 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-07-12 19:18:34,027 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:18:34,028 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 59 treesize of output 61 [2022-07-12 19:18:34,051 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:34,051 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 48 treesize of output 50 [2022-07-12 19:18:34,073 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-12 19:18:34,078 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 33 treesize of output 35 [2022-07-12 19:18:34,088 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-07-12 19:18:34,133 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-07-12 19:18:34,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-12 19:18:35,234 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:35,235 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 55 treesize of output 26 [2022-07-12 19:18:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:35,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:36,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1046647270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:36,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 50 [2022-07-12 19:18:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539970090] [2022-07-12 19:18:36,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:36,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 19:18:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 19:18:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3422, Unknown=6, NotChecked=118, Total=3782 [2022-07-12 19:18:36,056 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 50 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:18:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:38,822 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-07-12 19:18:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:18:38,822 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2022-07-12 19:18:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:38,823 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:18:38,823 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:18:38,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=406, Invalid=5909, Unknown=9, NotChecked=156, Total=6480 [2022-07-12 19:18:38,824 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:38,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1212 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 0 Unknown, 448 Unchecked, 0.3s Time] [2022-07-12 19:18:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:18:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2022-07-12 19:18:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-07-12 19:18:38,827 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 52 [2022-07-12 19:18:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:38,827 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-07-12 19:18:38,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:18:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-07-12 19:18:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:18:38,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:38,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:38,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:39,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:39,238 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:18:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 888325895, now seen corresponding path program 1 times [2022-07-12 19:18:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762227262] [2022-07-12 19:18:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:39,240 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:39,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 19:18:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:39,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 19:18:39,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:39,612 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-07-12 19:18:39,620 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-07-12 19:18:39,639 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-07-12 19:18:39,643 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-07-12 19:18:41,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:41,747 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 14 [2022-07-12 19:18:41,757 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:41,758 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 12 treesize of output 12 [2022-07-12 19:18:41,811 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-07-12 19:18:43,929 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:43,929 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 18 [2022-07-12 19:18:44,117 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-07-12 19:18:44,121 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-07-12 19:18:44,259 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-07-12 19:18:44,263 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-07-12 19:18:44,268 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 19:18:46,321 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-07-12 19:18:46,750 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:46,750 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-07-12 19:18:46,761 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-07-12 19:18:46,797 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:46,797 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 20 treesize of output 26 [2022-07-12 19:18:46,821 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:46,821 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 18 treesize of output 24 [2022-07-12 19:18:47,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 19:18:47,676 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:18:47,676 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 2 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 19:18:47,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:47,972 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 17 treesize of output 21 [2022-07-12 19:18:48,409 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-07-12 19:18:48,638 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:18:48,638 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 35 treesize of output 26 [2022-07-12 19:18:49,008 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 28 treesize of output 16 [2022-07-12 19:18:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:49,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:49,598 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 78 treesize of output 74 [2022-07-12 19:18:52,780 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 17 treesize of output 15 [2022-07-12 19:18:53,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:53,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762227262] [2022-07-12 19:18:53,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762227262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:53,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [647014088] [2022-07-12 19:18:53,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:53,474 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:53,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:53,475 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:53,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-12 19:18:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:53,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 19:18:53,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:54,181 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-07-12 19:18:54,871 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 8 treesize of output 6 [2022-07-12 19:18:55,382 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:55,383 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 21 treesize of output 28 [2022-07-12 19:18:55,818 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-07-12 19:18:56,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:56,312 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 38 treesize of output 37 [2022-07-12 19:18:57,268 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:57,269 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 68 treesize of output 31 [2022-07-12 19:18:57,278 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 17 treesize of output 13 [2022-07-12 19:18:57,286 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-07-12 19:18:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:58,541 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:18:58,541 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 74 treesize of output 66 [2022-07-12 19:18:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:58,555 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 69 treesize of output 65 [2022-07-12 19:18:58,623 INFO L356 Elim1Store]: treesize reduction 78, result has 42.2 percent of original size [2022-07-12 19:18:58,623 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 4 case distinctions, treesize of input 45 treesize of output 78 [2022-07-12 19:18:59,757 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 63 [2022-07-12 19:19:00,836 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-12 19:19:00,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 50 [2022-07-12 19:19:01,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-07-12 19:19:02,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:02,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-07-12 19:19:02,764 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 40 treesize of output 20 [2022-07-12 19:19:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:19:03,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:03,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:03,826 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 20 treesize of output 21 [2022-07-12 19:19:03,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:03,839 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 34 treesize of output 37 [2022-07-12 19:19:03,844 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-07-12 19:19:06,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [647014088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:06,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:19:06,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-07-12 19:19:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368865461] [2022-07-12 19:19:06,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:19:06,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 19:19:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 19:19:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=5776, Unknown=14, NotChecked=0, Total=6162 [2022-07-12 19:19:06,971 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 59 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 48 states have internal predecessors, (101), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:19:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:21,214 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-07-12 19:19:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 19:19:21,214 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 48 states have internal predecessors, (101), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2022-07-12 19:19:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:21,215 INFO L225 Difference]: With dead ends: 90 [2022-07-12 19:19:21,215 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 19:19:21,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2740 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=612, Invalid=10074, Unknown=26, NotChecked=0, Total=10712 [2022-07-12 19:19:21,218 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:21,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1130 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 631 Unchecked, 0.3s Time] [2022-07-12 19:19:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 19:19:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-07-12 19:19:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:19:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-07-12 19:19:21,220 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 57 [2022-07-12 19:19:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:21,220 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-07-12 19:19:21,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 48 states have internal predecessors, (101), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:19:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-07-12 19:19:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:19:21,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:21,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:21,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-07-12 19:19:21,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-12 19:19:21,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:19:21,621 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:19:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 888325896, now seen corresponding path program 1 times [2022-07-12 19:19:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473523797] [2022-07-12 19:19:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:21,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:21,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:21,623 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:19:21,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-12 19:19:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:22,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-12 19:19:22,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:22,064 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-07-12 19:19:22,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:22,082 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 14 [2022-07-12 19:19:22,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:22,117 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 11 treesize of output 7 [2022-07-12 19:19:22,122 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-07-12 19:19:22,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:22,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-12 19:19:22,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:22,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:22,350 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:19:22,350 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 17 treesize of output 15 [2022-07-12 19:19:22,486 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-07-12 19:19:24,821 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:19:24,822 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 18 [2022-07-12 19:19:25,295 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-07-12 19:19:25,593 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-07-12 19:19:25,599 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-07-12 19:19:25,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 19:19:28,417 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:19:28,418 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 20 treesize of output 26 [2022-07-12 19:19:28,445 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:19:28,445 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 19:19:28,510 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:19:28,511 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 14 treesize of output 20 [2022-07-12 19:19:28,520 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-07-12 19:19:29,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 19:19:29,909 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:19:29,909 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 2 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 19:19:31,213 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-07-12 19:19:31,270 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-07-12 19:19:31,631 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:19:31,631 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 40 treesize of output 27 [2022-07-12 19:19:31,673 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:19:31,673 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 19 treesize of output 18 [2022-07-12 19:19:32,171 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:19:32,171 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 43 treesize of output 19 [2022-07-12 19:19:32,185 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:19:32,185 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 22 treesize of output 10 [2022-07-12 19:19:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:19:32,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:33,682 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 90 treesize of output 82 [2022-07-12 19:19:33,745 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 198 treesize of output 194 [2022-07-12 19:19:33,761 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 398 treesize of output 382 [2022-07-12 19:19:44,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:44,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473523797] [2022-07-12 19:19:44,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473523797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:44,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1546573118] [2022-07-12 19:19:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:19:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:19:44,275 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:19:44,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-12 19:19:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:44,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 19:19:44,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:45,215 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-07-12 19:19:46,200 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 8 treesize of output 6 [2022-07-12 19:19:46,824 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:19:46,824 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 21 treesize of output 28 [2022-07-12 19:19:47,597 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-07-12 19:19:48,443 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:19:48,443 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 38 treesize of output 37 [2022-07-12 19:19:49,670 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:19:49,670 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 68 treesize of output 31 [2022-07-12 19:19:49,681 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 17 treesize of output 13 [2022-07-12 19:19:49,689 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-07-12 19:19:49,935 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-07-12 19:19:51,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:51,422 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:19:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 66 [2022-07-12 19:19:51,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:51,438 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 69 treesize of output 65 [2022-07-12 19:19:51,482 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-12 19:19:51,483 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 39 treesize of output 41 [2022-07-12 19:19:52,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2022-07-12 19:19:53,736 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-12 19:19:53,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 32 [2022-07-12 19:19:54,708 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-07-12 19:19:54,732 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-07-12 19:19:55,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:55,144 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 31 treesize of output 29 [2022-07-12 19:19:55,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:55,159 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-07-12 19:19:55,712 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 32 treesize of output 16 [2022-07-12 19:19:55,720 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-07-12 19:19:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:19:56,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:56,547 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2429) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2428) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2429 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2429) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-12 19:19:56,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:56,565 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 37 treesize of output 30 [2022-07-12 19:19:56,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:56,585 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 44 treesize of output 43 [2022-07-12 19:19:56,593 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 15 treesize of output 11 [2022-07-12 19:19:56,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:56,631 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 37 treesize of output 38 [2022-07-12 19:19:56,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:56,645 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 29 treesize of output 30 [2022-07-12 19:19:56,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:19:56,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-12 19:19:56,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:19:56,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 19:20:02,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1546573118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:20:02,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:20:02,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 59 [2022-07-12 19:20:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705673329] [2022-07-12 19:20:02,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:20:02,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-12 19:20:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:20:02,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-12 19:20:02,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=5796, Unknown=7, NotChecked=154, Total=6320 [2022-07-12 19:20:02,577 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 60 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 49 states have internal predecessors, (102), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:20:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:15,483 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-07-12 19:20:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 19:20:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 49 states have internal predecessors, (102), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2022-07-12 19:20:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:15,485 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:20:15,485 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:20:15,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2981 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=647, Invalid=11114, Unknown=15, NotChecked=214, Total=11990 [2022-07-12 19:20:15,486 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:15,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1790 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 601 Unchecked, 0.5s Time] [2022-07-12 19:20:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:20:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 19:20:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.24) internal successors, (93), 89 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:20:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-07-12 19:20:15,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 57 [2022-07-12 19:20:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:15,488 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-07-12 19:20:15,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 49 states have internal predecessors, (102), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:20:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-07-12 19:20:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 19:20:15,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:15,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:15,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-12 19:20:15,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-07-12 19:20:15,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:20:15,890 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:20:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1017304566, now seen corresponding path program 1 times [2022-07-12 19:20:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:20:15,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352550501] [2022-07-12 19:20:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:20:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:20:15,891 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:20:15,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-12 19:20:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:16,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-12 19:20:16,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:16,333 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-07-12 19:20:16,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 5 treesize of output 3 [2022-07-12 19:20:16,494 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:20:16,495 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 18 treesize of output 25 [2022-07-12 19:20:16,603 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 13 treesize of output 9 [2022-07-12 19:20:16,713 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-12 19:20:16,713 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 4 case distinctions, treesize of input 25 treesize of output 42 [2022-07-12 19:20:16,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-07-12 19:20:17,197 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:20:17,197 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 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 19:20:17,588 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 19:20:17,588 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 76 treesize of output 31 [2022-07-12 19:20:17,596 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 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-12 19:20:17,882 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 13 treesize of output 9 [2022-07-12 19:20:18,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:18,194 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:20:18,194 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 82 treesize of output 72 [2022-07-12 19:20:18,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:18,204 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 60 [2022-07-12 19:20:18,258 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-12 19:20:18,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 50 [2022-07-12 19:20:18,943 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2022-07-12 19:20:19,696 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-12 19:20:19,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 33 [2022-07-12 19:20:20,042 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-07-12 19:20:20,108 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 11 treesize of output 7 [2022-07-12 19:20:20,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:20,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, 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-07-12 19:20:20,143 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-07-12 19:20:20,268 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 33 treesize of output 31 [2022-07-12 19:20:20,274 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 18 treesize of output 20 [2022-07-12 19:20:20,280 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-07-12 19:20:20,401 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-07-12 19:20:20,410 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-07-12 19:20:20,640 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-07-12 19:20:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:20:20,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:20,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2534) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2533) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2022-07-12 19:20:21,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:21,007 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 45 treesize of output 46 [2022-07-12 19:20:21,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:21,025 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 84 treesize of output 87 [2022-07-12 19:20:21,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:21,035 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 72 treesize of output 64 [2022-07-12 19:20:21,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:21,056 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 114 treesize of output 113 [2022-07-12 19:20:21,064 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 50 treesize of output 46 [2022-07-12 19:20:21,070 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 94 treesize of output 90 [2022-07-12 19:20:22,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse25 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|))) (let ((.cse32 (not .cse25))) (let ((.cse21 (or .cse32 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse71 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse71 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))))) (.cse2 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse70 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse70 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse32)) (.cse3 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse69 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse68 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse67 (select .cse69 v_arrayElimCell_385))) (or (= (select .cse67 .cse68) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_381) .cse68)) (= (select .cse67 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse32)) (.cse8 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)) .cse32)) (.cse9 (or .cse32 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse66 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse65 v_arrayElimCell_385) .cse66) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_381) .cse66))))))) (.cse10 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse63 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse64 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse63 v_arrayElimCell_385) .cse64) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_381) .cse64))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse11 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= (select (select .cse62 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse62 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse25)) (.cse15 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse60 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse59 (select .cse60 v_arrayElimCell_385)) (.cse61 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= (select .cse59 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse60 v_arrayElimCell_381) .cse61) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse59 .cse61) |c_ULTIMATE.start_main_~data~0#1|))))) .cse25)) (.cse16 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse58 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse57 v_arrayElimCell_385) .cse58) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_381) .cse58))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse17 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)) .cse25))) (let ((.cse0 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse55 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse56 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse56)) (= (select (select .cse55 v_arrayElimCell_385) .cse56) |c_ULTIMATE.start_main_~data~0#1|)))) .cse32)) (.cse13 (and .cse2 .cse3 .cse8 .cse9 .cse10 .cse11 .cse15 .cse16 .cse17)) (.cse4 (or .cse25 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse52 (select .cse53 v_arrayElimCell_385)) (.cse54 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= (select .cse52 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse54)) (= (select .cse52 .cse54) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse5 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse50 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse51 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse51)) (= (select (select .cse50 v_arrayElimCell_385) .cse51) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse6 (or .cse25 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse7 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= (select (select .cse49 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) .cse25)) (.cse12 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse48 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse48)) (= (select (select .cse47 v_arrayElimCell_385) .cse48) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse18 (or .cse32 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse45 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse46 (select .cse44 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45)) (= (select .cse46 .cse45) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse46 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse14 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse22 (and (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse34 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse33 v_arrayElimCell_385) .cse34) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 v_arrayElimCell_381) .cse34))))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) .cse21 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse36 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse35 v_arrayElimCell_385) .cse36) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_arrayElimCell_381) .cse36))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) .cse8 .cse9 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse37 (select .cse39 v_arrayElimCell_385)) (.cse38 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= (select .cse37 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse38)) (= (select (select .cse39 v_arrayElimCell_381) .cse38) |c_ULTIMATE.start_main_~data~0#1|))))) .cse25) (or .cse25 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= (select (select .cse40 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse40 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse25) (or .cse32 (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse41 (select .cse43 v_arrayElimCell_385)) (.cse42 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select .cse41 .cse42) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 v_arrayElimCell_381) .cse42))))))))) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and .cse0 (or .cse1 (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse14) .cse15 .cse16 .cse17 .cse18)) (or (and .cse0 .cse2 (or .cse13 .cse1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18) .cse14) (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse20 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse20)) (= (select (select .cse19 v_arrayElimCell_385) .cse20) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse21 (or .cse22 .cse14) (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse24 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse24)) (= (select (select .cse23 v_arrayElimCell_385) .cse24) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) .cse8 (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) .cse25) (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse26 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse25) (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse29 (select .cse27 v_arrayElimCell_385)) (.cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= (select (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse28) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse29 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse28)))))) .cse25) (or .cse22 .cse1) (or (forall ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse31 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse31)) (= (select (select .cse30 v_arrayElimCell_385) .cse31) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse32)))))) is different from false [2022-07-12 19:20:28,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|))) (let ((.cse7 (not .cse3))) (let ((.cse33 (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select .cse72 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse13 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse3)) (.cse15 (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse70 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse71 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse70 v_arrayElimCell_381) .cse71) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse70 v_arrayElimCell_385) .cse71) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse16 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select (select .cse69 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse3)) (.cse17 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse68 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse67 v_arrayElimCell_381) .cse68) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse67 v_arrayElimCell_385) .cse68) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse18 (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse66 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse66 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse66 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse19 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse65 (select .cse63 v_arrayElimCell_385)) (.cse64 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_381) .cse64)) (= (select .cse65 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse65 .cse64) |c_ULTIMATE.start_main_~data~0#1|))))) .cse3)) (.cse11 (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse25 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse62 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse61 v_arrayElimCell_381) .cse62) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse61 v_arrayElimCell_385) .cse62) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse26 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse59 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse60 (select .cse58 v_arrayElimCell_385))) (or (= (select (select .cse58 v_arrayElimCell_381) .cse59) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse60 .cse59) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse60 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse7))) (let ((.cse23 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse57 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse56 v_arrayElimCell_385) .cse57) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse57))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse14 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse55 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse54 v_arrayElimCell_385) .cse55) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse55)))))))) (.cse20 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= (select (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse53 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse3)) (.cse10 (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse52 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse51 v_arrayElimCell_385) .cse52) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse52))))))) (.cse21 (or .cse3 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse22 (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse49 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse48 (select .cse50 v_arrayElimCell_385))) (or (= (select .cse48 .cse49) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse49)) (= (select .cse48 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse24 (and .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse11 .cse25 .cse26)) (.cse27 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse47 (select .cse45 v_arrayElimCell_385)) (.cse46 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= (select (select .cse45 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse46) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse47 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse47 .cse46) |c_ULTIMATE.start_main_~data~0#1|))))) .cse3)) (.cse29 (and (or .cse7 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse34 (select .cse35 v_arrayElimCell_385)) (.cse36 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse35 v_arrayElimCell_381) .cse36) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse34 .cse36) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse15 (or .cse3 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse38 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse39 (select .cse37 v_arrayElimCell_385))) (or (= (select (select .cse37 v_arrayElimCell_381) .cse38) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse38)) (= (select .cse39 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse11 (or .cse3 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= (select (select .cse40 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse40 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse42 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse41 v_arrayElimCell_381) .cse42) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse41 v_arrayElimCell_385) .cse42) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) .cse3) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse44 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse43 v_arrayElimCell_381) .cse44) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse43 v_arrayElimCell_385) .cse44) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse33)) (.cse28 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse1 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse0 v_arrayElimCell_385) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse2 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse3) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse4 (select .cse6 v_arrayElimCell_385)) (.cse5 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse5)))))) .cse7) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532)) (.cse9 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse8 v_arrayElimCell_385) .cse9) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse9))))))) .cse10 .cse11 (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11 (or .cse23 .cse24) .cse25 .cse26 .cse27) .cse28) (or .cse29 .cse23) (or .cse23 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11 .cse25 (or .cse24 .cse28) .cse26 .cse27)) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532))) (let ((.cse31 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse30 (select .cse32 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 .cse31)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse31)) (= (select .cse30 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse3) .cse33 (or .cse29 .cse28) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse3)))))) is different from false [2022-07-12 19:20:37,950 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse30 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base|))) (let ((.cse27 (not .cse30))) (let ((.cse9 (or .cse27 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select .cse72 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse10 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse70 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse69 (select .cse70 v_arrayElimCell_385)) (.cse71 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_arrayElimCell_381) .cse71)) (= (select .cse69 .cse71) |c_ULTIMATE.start_main_~data~0#1|))))) .cse30)) (.cse12 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse67 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse66 (select .cse68 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse67)) (= (select (select .cse68 v_arrayElimCell_381) .cse67) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse66 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse27)) (.cse13 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) .cse30)) (.cse15 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse64 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_385) .cse64)) (= (select (select .cse63 v_arrayElimCell_381) .cse64) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse21 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse62 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse61 v_arrayElimCell_385) .cse62)) (= (select (select .cse61 v_arrayElimCell_381) .cse62) |c_ULTIMATE.start_main_~data~0#1|)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse14 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))) .cse27)) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse60 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_385) .cse60)) (= (select (select .cse59 v_arrayElimCell_381) .cse60) |c_ULTIMATE.start_main_~data~0#1|)))) .cse27)) (.cse28 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse27))) (let ((.cse2 (and (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse30) .cse14 .cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse30) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse49 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_arrayElimCell_385) .cse49)) (= (select (select .cse48 v_arrayElimCell_381) .cse49) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse28 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse51 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_385) .cse51)) (= (select (select .cse50 v_arrayElimCell_381) .cse51) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse52 (select .cse54 v_arrayElimCell_385)) (.cse53 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse54 v_arrayElimCell_381) .cse53) |c_ULTIMATE.start_main_~data~0#1|))))) .cse27) (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse55 (select .cse57 v_arrayElimCell_385)) (.cse56 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_381) .cse56))))))))) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse5 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse30)) (.cse8 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse45 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_385) .cse45)))))))) (.cse11 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse43 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_arrayElimCell_385) .cse43))))) .cse27)) (.cse16 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse40 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse41 (select .cse39 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse40)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse40)) (= (select .cse41 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse27)) (.cse18 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_385) .cse38))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse6 (and .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse21)) (.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse20 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse34 (select .cse35 v_arrayElimCell_385)) (.cse36 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)) (= (select .cse34 .cse36) |c_ULTIMATE.start_main_~data~0#1|))))) .cse30))) (and (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse1 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 v_arrayElimCell_385) .cse1))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or .cse2 .cse3) (or (and .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse3) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse23 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse23)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_385) .cse23))))))) .cse11 (or .cse7 .cse2) .cse14 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse25 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse26 (select .cse24 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse27) .cse28 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse30) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse31 (select .cse33 v_arrayElimCell_385)) (.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32)))))) .cse30) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse30) (or .cse7 (and .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (or .cse6 .cse3) .cse19 .cse20 .cse21))))))) is different from false [2022-07-12 19:20:39,970 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse30 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base|))) (let ((.cse27 (not .cse30))) (let ((.cse9 (or .cse27 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select .cse72 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse10 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse70 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse69 (select .cse70 v_arrayElimCell_385)) (.cse71 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_arrayElimCell_381) .cse71)) (= (select .cse69 .cse71) |c_ULTIMATE.start_main_~data~0#1|))))) .cse30)) (.cse12 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse67 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse66 (select .cse68 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse67)) (= (select (select .cse68 v_arrayElimCell_381) .cse67) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse66 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse27)) (.cse13 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) .cse30)) (.cse15 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse64 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_385) .cse64)) (= (select (select .cse63 v_arrayElimCell_381) .cse64) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse21 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse62 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse61 v_arrayElimCell_385) .cse62)) (= (select (select .cse61 v_arrayElimCell_381) .cse62) |c_ULTIMATE.start_main_~data~0#1|)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse14 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))) .cse27)) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse60 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_385) .cse60)) (= (select (select .cse59 v_arrayElimCell_381) .cse60) |c_ULTIMATE.start_main_~data~0#1|)))) .cse27)) (.cse28 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse27))) (let ((.cse2 (and (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse30) .cse14 .cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse30) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse49 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_arrayElimCell_385) .cse49)) (= (select (select .cse48 v_arrayElimCell_381) .cse49) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse28 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse51 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_385) .cse51)) (= (select (select .cse50 v_arrayElimCell_381) .cse51) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse52 (select .cse54 v_arrayElimCell_385)) (.cse53 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse53)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse54 v_arrayElimCell_381) .cse53) |c_ULTIMATE.start_main_~data~0#1|))))) .cse27) (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse55 (select .cse57 v_arrayElimCell_385)) (.cse56 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_381) .cse56))))))))) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse5 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse30)) (.cse8 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse45 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_385) .cse45)))))))) (.cse11 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse43 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_arrayElimCell_385) .cse43))))) .cse27)) (.cse16 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse40 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse41 (select .cse39 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse40)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse40)) (= (select .cse41 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) .cse27)) (.cse18 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_385) .cse38))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse6 (and .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse21)) (.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse20 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse34 (select .cse35 v_arrayElimCell_385)) (.cse36 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)) (= (select .cse34 .cse36) |c_ULTIMATE.start_main_~data~0#1|))))) .cse30))) (and (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse1 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 v_arrayElimCell_385) .cse1))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or .cse2 .cse3) (or (and .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse3) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532)) (.cse23 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse23)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_385) .cse23))))))) .cse11 (or .cse7 .cse2) .cse14 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse25 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse26 (select .cse24 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 .cse25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse27) .cse28 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse30) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532))) (let ((.cse31 (select .cse33 v_arrayElimCell_385)) (.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32)))))) .cse30) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse30) (or .cse7 (and .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (or .cse6 .cse3) .cse19 .cse20 .cse21))))))) is different from true [2022-07-12 19:20:41,901 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))) (let ((.cse30 (not .cse23))) (let ((.cse8 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse72 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse71 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse70 (select .cse72 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 .cse71)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse72 v_arrayElimCell_381) .cse71)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 (bvadd v_arrayElimCell_383 (_ bv4 32)))))))))) (.cse9 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse69 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_385) .cse69)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_381) .cse69))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse11 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse12 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse67 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse14 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse66 (select .cse64 v_arrayElimCell_385)) (.cse65 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= (select (select .cse64 v_arrayElimCell_381) .cse65) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse65)))))))) (.cse15 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse63 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse62 v_arrayElimCell_385) .cse63)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse62 v_arrayElimCell_381) .cse63))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= (select (select .cse61 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse61 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))))) .cse23)) (.cse3 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse60 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_385) .cse60)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_381) .cse60))))))) (.cse7 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))) .cse30)) (.cse27 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32)))))))))) (let ((.cse19 (and (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))))))) (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse48 (select .cse50 v_arrayElimCell_385)) (.cse49 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select .cse48 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_381) .cse49))))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse52 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_385) .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_381) .cse52))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse23) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse54 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_385) .cse54)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_381) .cse54))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse3 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse56 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse55 (select .cse57 v_arrayElimCell_385))) (or (= (select .cse55 .cse56) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_381) .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (bvadd v_arrayElimCell_386 (_ bv4 32))))))))) .cse7 .cse27)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse2 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))))))) (.cse4 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse45 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_385) .cse45))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse5 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse43 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_arrayElimCell_385) .cse43))))))) (.cse6 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse41 (select .cse39 v_arrayElimCell_385)) (.cse40 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse40)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse40)))))) .cse23)) (.cse10 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_385) .cse38))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse0 (and .cse3 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17)) (.cse18 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse13 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse35 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse36 (select .cse34 v_arrayElimCell_385))) (or (= (select (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse35) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse35)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 (bvadd v_arrayElimCell_383 (_ bv4 32)))))))))) (.cse16 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))))))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse19 .cse1) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse21 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_385) .cse21))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse23) .cse5 .cse7 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse24 (select .cse26 v_arrayElimCell_385)) (.cse25 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= (select .cse24 .cse25) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse25) |c_ULTIMATE.start_main_~data~0#1|))))) .cse23) (or .cse19 .cse18) (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) .cse27 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse29 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse28 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse29) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_arrayElimCell_385) .cse29))))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse0 .cse18) .cse13 .cse14 .cse15 .cse16 .cse17)) (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse31 (select .cse32 v_arrayElimCell_385)) (.cse33 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select .cse31 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse33) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse33)))))))))))) is different from false [2022-07-12 19:20:43,920 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse23 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))) (let ((.cse30 (not .cse23))) (let ((.cse8 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse72 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse71 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse70 (select .cse72 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 .cse71)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse72 v_arrayElimCell_381) .cse71)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 (bvadd v_arrayElimCell_383 (_ bv4 32)))))))))) (.cse9 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse69 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_385) .cse69)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_381) .cse69))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse11 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse12 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse67 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse14 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse66 (select .cse64 v_arrayElimCell_385)) (.cse65 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= (select (select .cse64 v_arrayElimCell_381) .cse65) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse65)))))))) (.cse15 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse63 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse62 v_arrayElimCell_385) .cse63)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse62 v_arrayElimCell_381) .cse63))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= (select (select .cse61 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse61 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))))) .cse23)) (.cse3 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse60 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_385) .cse60)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_381) .cse60))))))) (.cse7 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))) .cse30)) (.cse27 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32)))))))))) (let ((.cse19 (and (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))))))) (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse48 (select .cse50 v_arrayElimCell_385)) (.cse49 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select .cse48 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_381) .cse49))))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse52 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_385) .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_381) .cse52))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse23) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse54 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_385) .cse54)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_381) .cse54))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse3 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse56 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse55 (select .cse57 v_arrayElimCell_385))) (or (= (select .cse55 .cse56) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_381) .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (bvadd v_arrayElimCell_386 (_ bv4 32))))))))) .cse7 .cse27)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse2 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))))))) (.cse4 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse45 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_385) .cse45))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse5 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse43 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_arrayElimCell_385) .cse43))))))) (.cse6 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse41 (select .cse39 v_arrayElimCell_385)) (.cse40 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse40)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse40)))))) .cse23)) (.cse10 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_385) .cse38))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse0 (and .cse3 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17)) (.cse18 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse13 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse35 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse36 (select .cse34 v_arrayElimCell_385))) (or (= (select (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse35) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse35)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 (bvadd v_arrayElimCell_383 (_ bv4 32)))))))))) (.cse16 (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))))))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse19 .cse1) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse21 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_385) .cse21))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse23) .cse5 .cse7 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse24 (select .cse26 v_arrayElimCell_385)) (.cse25 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= (select .cse24 .cse25) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse25) |c_ULTIMATE.start_main_~data~0#1|))))) .cse23) (or .cse19 .cse18) (or .cse23 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) .cse27 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532)) (.cse29 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse28 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse29) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_arrayElimCell_385) .cse29))))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse0 .cse18) .cse13 .cse14 .cse15 .cse16 .cse17)) (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2532))) (let ((.cse31 (select .cse32 v_arrayElimCell_385)) (.cse33 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select .cse31 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse33) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse33)))))))))))) is different from true [2022-07-12 19:20:52,389 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|)))) (let ((.cse22 (not .cse0))) (let ((.cse2 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse71 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse72 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_381) .cse72)) (= (select (select .cse71 v_arrayElimCell_385) .cse72) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse5 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse70 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_381) .cse70)) (= (select (select .cse69 v_arrayElimCell_385) .cse70) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse6 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse7 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select (select .cse68 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse13 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse66 (bvadd v_arrayElimCell_383 (_ bv4 32))) (.cse67 (select .cse65 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_381) .cse66)) (= (select .cse67 .cse66) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse67 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse15 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse64 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse64 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse64 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse18 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse63 (select .cse61 v_arrayElimCell_385)) (.cse62 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse61 v_arrayElimCell_381) .cse62)) (= (select .cse63 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse63 .cse62) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse21 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse60 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select .cse60 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse4 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse59 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse58 v_arrayElimCell_381) .cse59)) (= (select (select .cse58 v_arrayElimCell_385) .cse59) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse14 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (let ((.cse26 (and (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse48 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_381) .cse48)) (= (select (select .cse47 v_arrayElimCell_385) .cse48) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse21 .cse4 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse51 (select .cse49 v_arrayElimCell_385)) (.cse50 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_arrayElimCell_381) .cse50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select .cse51 .cse50) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse14 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse52 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse54 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_381) .cse54)) (= (select (select .cse53 v_arrayElimCell_385) .cse54) |c_ULTIMATE.start_main_~data~0#1|)))))) (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse56 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse57 (select .cse55 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_381) .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse56)) (= (select .cse57 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (.cse11 (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse15 .cse18)) (.cse20 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse46 (select .cse44 v_arrayElimCell_385)) (.cse45 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse46 (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse46 .cse45) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse8 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select (select .cse43 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse9 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse10 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse42 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse41 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse42) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse41 v_arrayElimCell_385) .cse42) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse16 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse39 (bvadd v_arrayElimCell_383 (_ bv4 32))) (.cse40 (select .cse38 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse39)) (= (select .cse40 .cse39) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse40 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse17 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse37 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse37) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse36 v_arrayElimCell_385) .cse37) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse35 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse35) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse34 v_arrayElimCell_385) .cse35) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse12 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (or (= (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse1 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20) .cse21 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse25 (select .cse23 v_arrayElimCell_385)) (.cse24 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse24) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select .cse25 .cse24) |c_ULTIMATE.start_main_~data~0#1|)))))) (or .cse26 .cse12) (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532))) (let ((.cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse29 (select .cse27 v_arrayElimCell_385))) (or (= (select (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse28) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse28)) (= (select .cse29 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) .cse10 (or .cse0 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse26 .cse20) .cse14 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse31 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse31) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse30 v_arrayElimCell_385) .cse31) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (and .cse2 (or .cse11 .cse20) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse12) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532)) (.cse33 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse33) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse32 v_arrayElimCell_385) .cse33) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))))))))) is different from false [2022-07-12 19:20:55,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse29 (not .cse19))) (let ((.cse1 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse71 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse72 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_381) .cse72)) (= (select (select .cse71 v_arrayElimCell_385) .cse72) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse3 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse70 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_381) .cse70)) (= (select (select .cse69 v_arrayElimCell_385) .cse70) |c_ULTIMATE.start_main_~data~0#1|))))))))) (.cse5 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select .cse68 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse29)) (.cse8 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse19)) (.cse11 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select (select .cse67 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse19)) (.cse12 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse66 (select .cse64 v_arrayElimCell_385)) (.cse65 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_381) .cse65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select .cse66 .cse65) |c_ULTIMATE.start_main_~data~0#1|))))) .cse29)) (.cse16 (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse62 (bvadd v_arrayElimCell_383 (_ bv4 32))) (.cse61 (select .cse63 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_381) .cse62)) (= (select .cse61 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse0 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)) .cse29)) (.cse14 (or .cse29 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse60 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_381) .cse60)) (= (select (select .cse59 v_arrayElimCell_385) .cse60) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse33 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse29))) (let ((.cse25 (and .cse0 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse47 (select .cse48 v_arrayElimCell_385)) (.cse49 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= (select .cse47 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_arrayElimCell_381) .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse49)))))) .cse19) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse51 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse52 (select .cse50 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_381) .cse51)) (= (select .cse52 .cse51) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse29) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse54 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_381) .cse54)) (= (select (select .cse53 v_arrayElimCell_385) .cse54) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= (select (select .cse55 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse57 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 v_arrayElimCell_381) .cse57)) (= (select (select .cse56 v_arrayElimCell_385) .cse57) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse14 (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse33)) (.cse2 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse44 (select .cse46 v_arrayElimCell_385)) (.cse45 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse45)) (= (select .cse44 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45)))))) .cse19)) (.cse4 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse43 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43)) (= (select (select .cse42 v_arrayElimCell_385) .cse43) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse6 (and .cse1 .cse0 .cse3 .cse5 .cse8 .cse11 .cse12 .cse14 .cse16)) (.cse18 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse41 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41)) (= (select (select .cse40 v_arrayElimCell_385) .cse41) |c_ULTIMATE.start_main_~data~0#1|)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse10 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse19)) (.cse13 (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= (select (select .cse39 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse15 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38)) (= (select (select .cse37 v_arrayElimCell_385) .cse38) |c_ULTIMATE.start_main_~data~0#1|)))) .cse29)) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse34 (select .cse35 v_arrayElimCell_385)) (.cse36 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)) (= (select .cse34 .cse36) |c_ULTIMATE.start_main_~data~0#1|))))) .cse29)) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and .cse0 (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse19) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse21 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21)) (= (select (select .cse20 v_arrayElimCell_385) .cse21) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse24 (select .cse22 v_arrayElimCell_385)) (.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse23)) (= (select .cse24 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse23)))))) .cse19) (or .cse25 .cse18) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse27 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse28 (select .cse26 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse27)) (= (select .cse28 .cse27) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse29) (or .cse25 .cse7) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse30 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse19) .cse15 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse32 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32)) (= (select (select .cse31 v_arrayElimCell_385) .cse32) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse18) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse7) .cse33))))) is different from false [2022-07-12 19:20:57,969 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse29 (not .cse19))) (let ((.cse1 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse71 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse72 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_381) .cse72)) (= (select (select .cse71 v_arrayElimCell_385) .cse72) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse3 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse70 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_381) .cse70)) (= (select (select .cse69 v_arrayElimCell_385) .cse70) |c_ULTIMATE.start_main_~data~0#1|))))))))) (.cse5 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse68 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select .cse68 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse29)) (.cse8 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse19)) (.cse11 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select (select .cse67 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse19)) (.cse12 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse66 (select .cse64 v_arrayElimCell_385)) (.cse65 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_381) .cse65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select .cse66 .cse65) |c_ULTIMATE.start_main_~data~0#1|))))) .cse29)) (.cse16 (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse62 (bvadd v_arrayElimCell_383 (_ bv4 32))) (.cse61 (select .cse63 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_381) .cse62)) (= (select .cse61 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse0 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)) .cse29)) (.cse14 (or .cse29 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse60 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_381) .cse60)) (= (select (select .cse59 v_arrayElimCell_385) .cse60) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse33 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385))) (or (= (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) .cse29))) (let ((.cse25 (and .cse0 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse47 (select .cse48 v_arrayElimCell_385)) (.cse49 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= (select .cse47 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_arrayElimCell_381) .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse49)))))) .cse19) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse51 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse52 (select .cse50 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_381) .cse51)) (= (select .cse52 .cse51) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse29) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse54 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_381) .cse54)) (= (select (select .cse53 v_arrayElimCell_385) .cse54) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= (select (select .cse55 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse57 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 v_arrayElimCell_381) .cse57)) (= (select (select .cse56 v_arrayElimCell_385) .cse57) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse14 (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) .cse33)) (.cse2 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse44 (select .cse46 v_arrayElimCell_385)) (.cse45 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse45)) (= (select .cse44 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse45)))))) .cse19)) (.cse4 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse43 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43)) (= (select (select .cse42 v_arrayElimCell_385) .cse43) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse6 (and .cse1 .cse0 .cse3 .cse5 .cse8 .cse11 .cse12 .cse14 .cse16)) (.cse18 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse41 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41)) (= (select (select .cse40 v_arrayElimCell_385) .cse41) |c_ULTIMATE.start_main_~data~0#1|)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse10 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse19)) (.cse13 (or .cse19 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= (select (select .cse39 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))))) (.cse15 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38)) (= (select (select .cse37 v_arrayElimCell_385) .cse38) |c_ULTIMATE.start_main_~data~0#1|)))) .cse29)) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse34 (select .cse35 v_arrayElimCell_385)) (.cse36 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)) (= (select .cse34 .cse36) |c_ULTIMATE.start_main_~data~0#1|))))) .cse29)) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and .cse0 (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse19) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse21 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21)) (= (select (select .cse20 v_arrayElimCell_385) .cse21) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse24 (select .cse22 v_arrayElimCell_385)) (.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse23)) (= (select .cse24 (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse23)))))) .cse19) (or .cse25 .cse18) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse27 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse28 (select .cse26 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse27)) (= (select .cse28 .cse27) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) .cse29) (or .cse25 .cse7) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (= (select (select .cse30 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse19) .cse15 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse32 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32)) (= (select (select .cse31 v_arrayElimCell_385) .cse32) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse18) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse7) .cse33))))) is different from true [2022-07-12 19:21:04,426 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse30 (not .cse22))) (let ((.cse31 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select .cse72 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse5 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse22)) (.cse9 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse71 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (bvadd v_arrayElimCell_386 (_ bv4 32))))))) .cse30)) (.cse10 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse70 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse69 v_arrayElimCell_381) .cse70) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_385) .cse70))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse12 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32))))) .cse30)) (.cse14 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse68 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse67 v_arrayElimCell_381) .cse68) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_385) .cse68))))) .cse30)) (.cse15 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse66 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse65 v_arrayElimCell_381) .cse66) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_385) .cse66))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse16 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_381) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) .cse22)) (.cse19 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse61 (select .cse62 v_arrayElimCell_385)) (.cse63 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= (select (select .cse62 v_arrayElimCell_381) .cse63) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse63)))))) .cse30)) (.cse20 (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse60 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse58 (select .cse60 v_arrayElimCell_385)) (.cse59 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse60 v_arrayElimCell_381) .cse59))))))))) (let ((.cse3 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse55 (select .cse56 v_arrayElimCell_385)) (.cse57 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse57)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse57)))))) .cse30)) (.cse4 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse54 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse54)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_385) .cse54))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse6 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))) .cse22)) (.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse7 (and .cse5 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse19 .cse20)) (.cse13 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse50 (select .cse52 v_arrayElimCell_385)) (.cse51 (bvadd v_arrayElimCell_383 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse51)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse51)))))) .cse22)) (.cse17 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) .cse22)) (.cse18 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_383 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd v_arrayElimCell_383 (_ bv4 32)))) (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse48 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse48)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_385) .cse48))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd v_arrayElimCell_383 (_ bv4 32))))))) (.cse11 (or .cse30 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse46 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse46)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 v_arrayElimCell_385) .cse46))))))) (.cse8 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse21 (and (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select (select .cse34 v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse36 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse35 v_arrayElimCell_381) .cse36) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_arrayElimCell_385) .cse36))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) .cse22) .cse31 .cse12 .cse14 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse38 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse39 (select .cse37 v_arrayElimCell_385))) (or (= (select (select .cse37 v_arrayElimCell_381) .cse38) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse38)) (= (select .cse39 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) .cse30) (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse41 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= (select (select .cse40 v_arrayElimCell_381) .cse41) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_385) .cse41))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_381) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_381 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse42 (select .cse44 v_arrayElimCell_385)) (.cse43 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select .cse42 .cse43) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse44 v_arrayElimCell_381) .cse43) |c_ULTIMATE.start_main_~data~0#1|))))) .cse22)))) (and (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_385 (_ BitVec 32))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse1 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 v_arrayElimCell_385) .cse1))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) v_arrayElimCell_385) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))))) (or .cse2 (and .cse3 .cse4 .cse5 .cse6 (or .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse2 .cse21) (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_385) (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 (or .cse2 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse8) (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse24 (select .cse26 v_arrayElimCell_385)) (.cse25 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (= (select .cse24 .cse25) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse25)))))) .cse22) .cse11 (or (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532))) (let ((.cse28 (bvadd v_arrayElimCell_386 (_ bv4 32))) (.cse29 (select .cse27 v_arrayElimCell_385))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse28)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse28)) (= (select .cse29 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) .cse30) .cse31 .cse12 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_386 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532)) (.cse33 (bvadd v_arrayElimCell_386 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse33)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 v_arrayElimCell_385) .cse33))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))))) (or .cse8 .cse21) (or .cse22 (forall ((v_ArrVal_2526 (_ BitVec 32)) (v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2526)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2530) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2532) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))))))) is different from false [2022-07-12 19:21:07,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:07,229 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2022-07-12 19:21:07,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:07,266 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 152 treesize of output 155 [2022-07-12 19:21:07,277 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 138 treesize of output 130 [2022-07-12 19:21:07,288 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 66 treesize of output 62 [2022-07-12 19:21:07,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:07,431 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 123 [2022-07-12 19:21:07,530 INFO L356 Elim1Store]: treesize reduction 15, result has 53.1 percent of original size [2022-07-12 19:21:07,531 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 430 treesize of output 426 [2022-07-12 19:21:07,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:07,569 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 406 treesize of output 396 [2022-07-12 19:21:07,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:07,608 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 197 treesize of output 197 [2022-07-12 19:21:08,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,085 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2022-07-12 19:21:08,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:08,101 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 72 treesize of output 64 [2022-07-12 19:21:08,111 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 30 treesize of output 28 [2022-07-12 19:21:08,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,162 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 87 [2022-07-12 19:21:08,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:08,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 214 [2022-07-12 19:21:08,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,282 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 168 treesize of output 168 [2022-07-12 19:21:08,294 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 66 treesize of output 62 [2022-07-12 19:21:08,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,398 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 87 [2022-07-12 19:21:08,507 INFO L356 Elim1Store]: treesize reduction 15, result has 53.1 percent of original size [2022-07-12 19:21:08,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 503 treesize of output 495 [2022-07-12 19:21:08,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,568 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 239 treesize of output 237 [2022-07-12 19:21:08,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,608 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 463 treesize of output 449 [2022-07-12 19:21:08,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:08,926 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 157 [2022-07-12 19:21:08,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:09,103 INFO L356 Elim1Store]: treesize reduction 30, result has 52.4 percent of original size [2022-07-12 19:21:09,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 417 treesize of output 425 [2022-07-12 19:21:09,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:09,144 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 331 treesize of output 323 [2022-07-12 19:21:09,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:09,197 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 131 treesize of output 135 [2022-07-12 19:21:09,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:09,435 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 121 [2022-07-12 19:21:09,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:09,569 INFO L356 Elim1Store]: treesize reduction 15, result has 53.1 percent of original size [2022-07-12 19:21:09,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 348 [2022-07-12 19:21:09,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:09,608 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 299 treesize of output 295 [2022-07-12 19:21:09,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:09,648 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 131 treesize of output 135 [2022-07-12 19:21:09,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:09,841 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 123 [2022-07-12 19:21:09,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:10,038 INFO L356 Elim1Store]: treesize reduction 30, result has 52.4 percent of original size [2022-07-12 19:21:10,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 366 [2022-07-12 19:21:10,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:10,078 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 301 treesize of output 295 [2022-07-12 19:21:10,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:10,116 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 131 treesize of output 135 [2022-07-12 19:21:10,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:10,581 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2022-07-12 19:21:10,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:10,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 155 [2022-07-12 19:21:10,623 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 138 treesize of output 130 [2022-07-12 19:21:10,633 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 66 treesize of output 62 [2022-07-12 19:21:10,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:10,704 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 123 [2022-07-12 19:21:10,920 INFO L356 Elim1Store]: treesize reduction 30, result has 54.5 percent of original size [2022-07-12 19:21:10,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 430 treesize of output 445 [2022-07-12 19:21:10,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:10,962 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 406 treesize of output 396 [2022-07-12 19:21:11,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:11,007 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 197 treesize of output 197 [2022-07-12 19:21:11,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:11,598 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 157 [2022-07-12 19:21:11,873 INFO L356 Elim1Store]: treesize reduction 56, result has 46.7 percent of original size [2022-07-12 19:21:11,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 781 treesize of output 795 [2022-07-12 19:21:11,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:11,911 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 743 treesize of output 717 [2022-07-12 19:21:11,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:11,945 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 581 treesize of output 573