./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:19:41,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:19:41,316 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:19:41,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:19:41,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:19:41,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:19:41,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:19:41,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:19:41,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:19:41,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:19:41,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:19:41,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:19:41,355 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:19:41,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:19:41,357 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:19:41,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:19:41,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:19:41,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:19:41,359 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:19:41,360 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:19:41,360 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:19:41,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:19:41,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:19:41,363 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:19:41,363 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:19:41,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:19:41,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:19:41,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:19:41,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:19:41,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:19:41,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:19:41,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:19:41,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:19:41,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:19:41,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:19:41,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:19:41,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:19:41,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:19:41,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:19:41,370 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2023-11-21 22:19:41,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:19:41,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:19:41,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:19:41,699 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:19:41,701 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:19:41,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2023-11-21 22:19:44,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:19:45,198 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:19:45,199 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2023-11-21 22:19:45,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/data/0d474ed42/36957e00252249a2852573cd37bcdabe/FLAGcda74cf9c [2023-11-21 22:19:45,229 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/data/0d474ed42/36957e00252249a2852573cd37bcdabe [2023-11-21 22:19:45,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:19:45,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:19:45,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:19:45,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:19:45,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:19:45,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a64023a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45, skipping insertion in model container [2023-11-21 22:19:45,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,287 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:19:45,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:19:45,654 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:19:45,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:19:45,726 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:19:45,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45 WrapperNode [2023-11-21 22:19:45,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:19:45,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:19:45,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:19:45,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:19:45,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,772 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-11-21 22:19:45,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:19:45,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:19:45,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:19:45,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:19:45,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:19:45,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:19:45,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:19:45,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:19:45,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (1/1) ... [2023-11-21 22:19:45,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:19:45,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:19:45,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:19:45,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:19:45,926 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-21 22:19:45,927 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-21 22:19:45,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:19:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:19:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:19:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:19:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 22:19:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:19:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:19:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:19:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:19:45,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:19:46,092 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:19:46,094 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:19:46,136 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-21 22:19:46,147 WARN L820 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-21 22:19:46,405 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2023-11-21 22:19:46,406 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2023-11-21 22:19:46,406 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2023-11-21 22:19:46,406 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2023-11-21 22:19:46,406 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2023-11-21 22:19:46,408 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:19:46,481 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:19:46,482 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:19:46,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:19:46 BoogieIcfgContainer [2023-11-21 22:19:46,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:19:46,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:19:46,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:19:46,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:19:46,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:19:45" (1/3) ... [2023-11-21 22:19:46,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c83af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:19:46, skipping insertion in model container [2023-11-21 22:19:46,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:19:45" (2/3) ... [2023-11-21 22:19:46,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c83af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:19:46, skipping insertion in model container [2023-11-21 22:19:46,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:19:46" (3/3) ... [2023-11-21 22:19:46,524 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2023-11-21 22:19:46,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:19:46,544 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-21 22:19:46,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:19:46,599 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12656e8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:19:46,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-21 22:19:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-21 22:19:46,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:46,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-21 22:19:46,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:46,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 172438, now seen corresponding path program 1 times [2023-11-21 22:19:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645642933] [2023-11-21 22:19:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645642933] [2023-11-21 22:19:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645642933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:46,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:19:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284993102] [2023-11-21 22:19:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:46,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:46,900 INFO L87 Difference]: Start difference. First operand has 66 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:47,041 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-21 22:19:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-21 22:19:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:47,052 INFO L225 Difference]: With dead ends: 62 [2023-11-21 22:19:47,052 INFO L226 Difference]: Without dead ends: 57 [2023-11-21 22:19:47,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:47,060 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:47,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-21 22:19:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-21 22:19:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 2.103448275862069) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-21 22:19:47,108 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 3 [2023-11-21 22:19:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:47,109 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-21 22:19:47,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-21 22:19:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-21 22:19:47,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:47,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-21 22:19:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:19:47,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:47,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 172439, now seen corresponding path program 1 times [2023-11-21 22:19:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991706053] [2023-11-21 22:19:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:47,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991706053] [2023-11-21 22:19:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991706053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:47,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:47,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:19:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93623506] [2023-11-21 22:19:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:47,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:47,338 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:47,439 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2023-11-21 22:19:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-21 22:19:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:47,441 INFO L225 Difference]: With dead ends: 59 [2023-11-21 22:19:47,441 INFO L226 Difference]: Without dead ends: 59 [2023-11-21 22:19:47,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:47,448 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:47,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-21 22:19:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2023-11-21 22:19:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.967741935483871) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2023-11-21 22:19:47,464 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 3 [2023-11-21 22:19:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:47,465 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2023-11-21 22:19:47,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2023-11-21 22:19:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:19:47,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:47,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:47,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:19:47,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:47,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:47,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434129, now seen corresponding path program 1 times [2023-11-21 22:19:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246815023] [2023-11-21 22:19:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246815023] [2023-11-21 22:19:47,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246815023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:47,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:47,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:19:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738344811] [2023-11-21 22:19:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:47,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:47,641 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:47,697 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-21 22:19:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:47,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-21 22:19:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:47,699 INFO L225 Difference]: With dead ends: 54 [2023-11-21 22:19:47,699 INFO L226 Difference]: Without dead ends: 54 [2023-11-21 22:19:47,700 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 [2023-11-21 22:19:47,701 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:47,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:19:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-21 22:19:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-21 22:19:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.903225806451613) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-21 22:19:47,708 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 8 [2023-11-21 22:19:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:47,709 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-21 22:19:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-21 22:19:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:19:47,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:47,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:47,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:19:47,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:47,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434130, now seen corresponding path program 1 times [2023-11-21 22:19:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:47,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293430298] [2023-11-21 22:19:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:47,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293430298] [2023-11-21 22:19:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293430298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:19:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865037867] [2023-11-21 22:19:47,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:47,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:47,861 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:47,919 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-11-21 22:19:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-21 22:19:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:47,920 INFO L225 Difference]: With dead ends: 52 [2023-11-21 22:19:47,921 INFO L226 Difference]: Without dead ends: 52 [2023-11-21 22:19:47,921 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 [2023-11-21 22:19:47,922 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:47,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-21 22:19:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-21 22:19:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-11-21 22:19:47,929 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 8 [2023-11-21 22:19:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:47,929 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-11-21 22:19:47,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-11-21 22:19:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:19:47,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:47,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:19:47,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:47,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1828548969, now seen corresponding path program 1 times [2023-11-21 22:19:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098234964] [2023-11-21 22:19:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098234964] [2023-11-21 22:19:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098234964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:19:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834502743] [2023-11-21 22:19:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:48,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:48,043 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:48,072 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-11-21 22:19:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:48,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-21 22:19:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:48,074 INFO L225 Difference]: With dead ends: 57 [2023-11-21 22:19:48,074 INFO L226 Difference]: Without dead ends: 57 [2023-11-21 22:19:48,074 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 [2023-11-21 22:19:48,076 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:48,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:19:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-21 22:19:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-11-21 22:19:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-21 22:19:48,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 8 [2023-11-21 22:19:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:48,082 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-21 22:19:48,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-11-21 22:19:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:19:48,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:48,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:48,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:19:48,084 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:48,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash 483574356, now seen corresponding path program 1 times [2023-11-21 22:19:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891989751] [2023-11-21 22:19:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891989751] [2023-11-21 22:19:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891989751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:19:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808793197] [2023-11-21 22:19:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:48,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:19:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:48,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:19:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:19:48,241 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:48,331 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-11-21 22:19:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:19:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 22:19:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:48,333 INFO L225 Difference]: With dead ends: 56 [2023-11-21 22:19:48,333 INFO L226 Difference]: Without dead ends: 56 [2023-11-21 22:19:48,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:48,334 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:48,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 77 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-21 22:19:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2023-11-21 22:19:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-11-21 22:19:48,339 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 10 [2023-11-21 22:19:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:48,340 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-11-21 22:19:48,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-11-21 22:19:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:19:48,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:48,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:48,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:19:48,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:48,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash 483574357, now seen corresponding path program 1 times [2023-11-21 22:19:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377252732] [2023-11-21 22:19:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377252732] [2023-11-21 22:19:48,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377252732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:48,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:48,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:19:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525040427] [2023-11-21 22:19:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:48,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:19:48,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:19:48,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:48,612 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:48,801 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-11-21 22:19:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:19:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 22:19:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:48,803 INFO L225 Difference]: With dead ends: 54 [2023-11-21 22:19:48,804 INFO L226 Difference]: Without dead ends: 54 [2023-11-21 22:19:48,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:19:48,807 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:48,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 99 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-21 22:19:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-21 22:19:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-21 22:19:48,822 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2023-11-21 22:19:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:48,822 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-21 22:19:48,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-21 22:19:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:19:48,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:48,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:48,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:19:48,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:48,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash 846366343, now seen corresponding path program 1 times [2023-11-21 22:19:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50054149] [2023-11-21 22:19:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50054149] [2023-11-21 22:19:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50054149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:19:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306467313] [2023-11-21 22:19:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:48,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:19:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:19:48,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:19:48,937 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:49,014 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-21 22:19:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:19:49,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-21 22:19:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:49,015 INFO L225 Difference]: With dead ends: 52 [2023-11-21 22:19:49,015 INFO L226 Difference]: Without dead ends: 52 [2023-11-21 22:19:49,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:19:49,017 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:49,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-21 22:19:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-21 22:19:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-11-21 22:19:49,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2023-11-21 22:19:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:49,022 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-11-21 22:19:49,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-11-21 22:19:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:19:49,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:49,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:49,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:19:49,024 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:49,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash 846366344, now seen corresponding path program 1 times [2023-11-21 22:19:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:49,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020850036] [2023-11-21 22:19:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:49,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020850036] [2023-11-21 22:19:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020850036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:19:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37196383] [2023-11-21 22:19:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:19:49,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:19:49,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:19:49,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:19:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:49,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:19:49,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:19:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:49,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:19:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:49,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37196383] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:19:49,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:19:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-21 22:19:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235016261] [2023-11-21 22:19:49,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:19:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:19:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:19:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:49,375 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:49,416 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2023-11-21 22:19:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:19:49,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-21 22:19:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:49,418 INFO L225 Difference]: With dead ends: 65 [2023-11-21 22:19:49,418 INFO L226 Difference]: Without dead ends: 65 [2023-11-21 22:19:49,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:49,422 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:49,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:19:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-21 22:19:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-21 22:19:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-21 22:19:49,430 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 13 [2023-11-21 22:19:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:49,430 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-21 22:19:49,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-21 22:19:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 22:19:49,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:49,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:49,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:19:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-21 22:19:49,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:49,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875891, now seen corresponding path program 1 times [2023-11-21 22:19:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374794877] [2023-11-21 22:19:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374794877] [2023-11-21 22:19:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374794877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:19:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629921396] [2023-11-21 22:19:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:49,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:19:49,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:19:49,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:19:49,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:19:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:50,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-21 22:19:50,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:19:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:19:50,154 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:19:50,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-21 22:19:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:50,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:19:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629921396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:19:50,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:19:50,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2023-11-21 22:19:50,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409369907] [2023-11-21 22:19:50,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:19:50,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:19:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:19:50,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:19:50,362 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:50,493 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-21 22:19:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:19:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-21 22:19:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:50,495 INFO L225 Difference]: With dead ends: 61 [2023-11-21 22:19:50,495 INFO L226 Difference]: Without dead ends: 61 [2023-11-21 22:19:50,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:19:50,496 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:50,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 137 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-21 22:19:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-21 22:19:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-21 22:19:50,513 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 15 [2023-11-21 22:19:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:50,513 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-21 22:19:50,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-21 22:19:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-21 22:19:50,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:50,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:50,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:19:50,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-21 22:19:50,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:50,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 315285918, now seen corresponding path program 1 times [2023-11-21 22:19:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305538276] [2023-11-21 22:19:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-21 22:19:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305538276] [2023-11-21 22:19:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305538276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:19:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876940506] [2023-11-21 22:19:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:50,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:19:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:50,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:19:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:19:50,941 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:51,047 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-11-21 22:19:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:19:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-21 22:19:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:51,049 INFO L225 Difference]: With dead ends: 61 [2023-11-21 22:19:51,049 INFO L226 Difference]: Without dead ends: 61 [2023-11-21 22:19:51,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:51,050 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:51,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-21 22:19:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2023-11-21 22:19:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-11-21 22:19:51,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2023-11-21 22:19:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:51,055 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-11-21 22:19:51,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-11-21 22:19:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-21 22:19:51,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:51,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:51,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:19:51,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:51,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 315285919, now seen corresponding path program 1 times [2023-11-21 22:19:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:51,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187976577] [2023-11-21 22:19:51,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:19:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:51,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187976577] [2023-11-21 22:19:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187976577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:19:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391902748] [2023-11-21 22:19:51,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:51,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:19:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:51,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:19:51,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:19:51,440 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:51,539 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-11-21 22:19:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:19:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-21 22:19:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:51,540 INFO L225 Difference]: With dead ends: 64 [2023-11-21 22:19:51,540 INFO L226 Difference]: Without dead ends: 64 [2023-11-21 22:19:51,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:51,542 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:51,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-21 22:19:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-11-21 22:19:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.346938775510204) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-11-21 22:19:51,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2023-11-21 22:19:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:51,545 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-11-21 22:19:51,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-11-21 22:19:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 22:19:51,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:51,547 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:19:51,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:51,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -410650484, now seen corresponding path program 1 times [2023-11-21 22:19:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265251937] [2023-11-21 22:19:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 22:19:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265251937] [2023-11-21 22:19:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265251937] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:19:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149289100] [2023-11-21 22:19:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:52,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:19:52,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:19:52,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:19:52,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:19:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:52,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-21 22:19:52,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:19:52,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:19:52,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:19:52,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 22:19:53,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:19:53,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:19:53,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:19:53,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-21 22:19:53,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-21 22:19:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:19:53,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:19:53,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_842))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_844))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-21 22:19:53,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:19:53,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-11-21 22:19:53,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:19:53,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 214 [2023-11-21 22:19:53,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 146 [2023-11-21 22:19:53,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-21 22:19:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2023-11-21 22:19:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149289100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:19:53,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:19:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-11-21 22:19:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517287928] [2023-11-21 22:19:53,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:19:53,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-21 22:19:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-21 22:19:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=521, Unknown=1, NotChecked=46, Total=650 [2023-11-21 22:19:53,969 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:54,711 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-21 22:19:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:19:54,711 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-21 22:19:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:54,712 INFO L225 Difference]: With dead ends: 61 [2023-11-21 22:19:54,712 INFO L226 Difference]: Without dead ends: 61 [2023-11-21 22:19:54,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=795, Unknown=1, NotChecked=60, Total=1056 [2023-11-21 22:19:54,714 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:54,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 340 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 342 Invalid, 0 Unknown, 27 Unchecked, 0.4s Time] [2023-11-21 22:19:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-21 22:19:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-21 22:19:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-21 22:19:54,717 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 32 [2023-11-21 22:19:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:54,717 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-21 22:19:54,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-21 22:19:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 22:19:54,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:54,721 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:54,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:19:54,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-21 22:19:54,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:54,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash 501948956, now seen corresponding path program 1 times [2023-11-21 22:19:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494953740] [2023-11-21 22:19:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-21 22:19:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494953740] [2023-11-21 22:19:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494953740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:19:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977061821] [2023-11-21 22:19:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:55,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:19:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:55,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:19:55,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:19:55,131 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:55,238 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2023-11-21 22:19:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:19:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-21 22:19:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:55,240 INFO L225 Difference]: With dead ends: 65 [2023-11-21 22:19:55,240 INFO L226 Difference]: Without dead ends: 65 [2023-11-21 22:19:55,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:19:55,241 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:55,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 54 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-21 22:19:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-11-21 22:19:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-21 22:19:55,243 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2023-11-21 22:19:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:55,244 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-21 22:19:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-21 22:19:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 22:19:55,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:55,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:55,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:19:55,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:55,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 501948957, now seen corresponding path program 1 times [2023-11-21 22:19:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853899797] [2023-11-21 22:19:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:19:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853899797] [2023-11-21 22:19:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853899797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:19:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553154167] [2023-11-21 22:19:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:19:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:19:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:19:55,636 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:19:55,794 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-11-21 22:19:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:19:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-21 22:19:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:19:55,795 INFO L225 Difference]: With dead ends: 62 [2023-11-21 22:19:55,795 INFO L226 Difference]: Without dead ends: 62 [2023-11-21 22:19:55,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:19:55,796 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:19:55,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:19:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-21 22:19:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-11-21 22:19:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-21 22:19:55,799 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2023-11-21 22:19:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:19:55,799 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-21 22:19:55,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-21 22:19:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 22:19:55,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:19:55,801 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:55,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:19:55,801 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:19:55,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 501948994, now seen corresponding path program 1 times [2023-11-21 22:19:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416744982] [2023-11-21 22:19:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:19:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416744982] [2023-11-21 22:19:56,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416744982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:19:56,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487430426] [2023-11-21 22:19:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:56,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:19:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:19:56,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:19:57,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:19:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:57,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-21 22:19:57,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:19:57,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:19:57,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:19:57,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 22:19:57,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:19:57,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:19:57,469 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:19:57,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:19:57,533 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-21 22:19:57,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-11-21 22:19:57,636 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:19:57,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 57 [2023-11-21 22:19:57,837 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:19:57,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 52 [2023-11-21 22:19:57,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:19:57,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 42 [2023-11-21 22:19:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:19:58,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:19:58,166 INFO L349 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2023-11-21 22:19:58,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2023-11-21 22:19:58,239 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1323 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1323))))) is different from false [2023-11-21 22:19:58,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2023-11-21 22:19:58,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-21 22:19:58,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:19:58,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-21 22:19:58,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 22:19:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2023-11-21 22:19:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487430426] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:19:59,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:19:59,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2023-11-21 22:19:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054826613] [2023-11-21 22:19:59,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:19:59,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-21 22:19:59,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-21 22:19:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=655, Unknown=2, NotChecked=52, Total=812 [2023-11-21 22:19:59,348 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:00,070 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-11-21 22:20:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:20:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-21 22:20:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:00,071 INFO L225 Difference]: With dead ends: 73 [2023-11-21 22:20:00,071 INFO L226 Difference]: Without dead ends: 73 [2023-11-21 22:20:00,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=216, Invalid=976, Unknown=2, NotChecked=66, Total=1260 [2023-11-21 22:20:00,073 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:00,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 230 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 472 Invalid, 0 Unknown, 51 Unchecked, 0.4s Time] [2023-11-21 22:20:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-21 22:20:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2023-11-21 22:20:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-21 22:20:00,075 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 34 [2023-11-21 22:20:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:00,076 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-21 22:20:00,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-21 22:20:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 22:20:00,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:00,077 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:00,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:20:00,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-21 22:20:00,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:20:00,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash 501948995, now seen corresponding path program 1 times [2023-11-21 22:20:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363326029] [2023-11-21 22:20:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:20:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363326029] [2023-11-21 22:20:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363326029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415728210] [2023-11-21 22:20:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:01,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:01,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:01,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:20:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:02,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-21 22:20:02,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:02,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:20:02,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:20:02,350 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:20:02,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-21 22:20:02,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:20:02,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 22:20:02,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:20:02,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:20:02,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:20:02,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:20:02,590 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:20:02,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-21 22:20:02,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 22:20:02,683 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-21 22:20:02,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-11-21 22:20:02,720 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 22:20:02,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:20:02,833 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 22:20:02,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-11-21 22:20:02,849 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 22:20:02,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2023-11-21 22:20:03,051 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 22:20:03,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-11-21 22:20:03,063 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:20:03,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 59 [2023-11-21 22:20:03,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:20:03,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 49 [2023-11-21 22:20:03,139 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:20:03,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:20:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:20:03,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:20:04,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:20:04,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 442 [2023-11-21 22:20:04,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 146 [2023-11-21 22:20:04,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:20:04,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:20:04,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 834 treesize of output 832 [2023-11-21 22:20:04,321 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:20:04,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:20:04,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 974 treesize of output 968 [2023-11-21 22:20:04,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-11-21 22:20:04,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2023-11-21 22:20:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:20:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415728210] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:20:04,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:20:04,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 30 [2023-11-21 22:20:04,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873416663] [2023-11-21 22:20:04,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:20:04,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-21 22:20:04,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:04,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-21 22:20:04,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=823, Unknown=4, NotChecked=0, Total=930 [2023-11-21 22:20:04,826 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 31 states, 30 states have (on average 2.933333333333333) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:07,145 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-11-21 22:20:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:20:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.933333333333333) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-21 22:20:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:07,149 INFO L225 Difference]: With dead ends: 69 [2023-11-21 22:20:07,149 INFO L226 Difference]: Without dead ends: 69 [2023-11-21 22:20:07,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=256, Invalid=1380, Unknown=4, NotChecked=0, Total=1640 [2023-11-21 22:20:07,151 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 65 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 224 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 688 Invalid, 1 Unknown, 0 Unchecked, 1.5s Time] [2023-11-21 22:20:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-21 22:20:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2023-11-21 22:20:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-21 22:20:07,154 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 34 [2023-11-21 22:20:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:07,154 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-21 22:20:07,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.933333333333333) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-21 22:20:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-21 22:20:07,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:07,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:07,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-21 22:20:07,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 22:20:07,361 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:20:07,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1336670330, now seen corresponding path program 1 times [2023-11-21 22:20:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466385102] [2023-11-21 22:20:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:08,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466385102] [2023-11-21 22:20:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466385102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583473621] [2023-11-21 22:20:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:08,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:08,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:20:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:08,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-21 22:20:08,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:08,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:20:08,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:20:08,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 22:20:08,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 22:20:09,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:20:09,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-21 22:20:09,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-21 22:20:09,058 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:20:09,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:20:09,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 22:20:09,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-11-21 22:20:09,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-21 22:20:09,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:20:09,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2023-11-21 22:20:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:20:09,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:20:09,432 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1827 (Array Int Int))) (or (not (= v_ArrVal_1827 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_1827 |c_ULTIMATE.start_main_~ptr~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~head~1#1.base| (select v_ArrVal_1827 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~head~1#1.base|) (+ |c_ULTIMATE.start_main_~head~1#1.offset| 8))) 1))) is different from false [2023-11-21 22:20:09,482 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-21 22:20:09,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-11-21 22:20:09,535 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1824) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2023-11-21 22:20:09,550 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1823 (Array Int Int))) (or (not (= v_ArrVal_1823 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1823 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1823) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1824) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-11-21 22:20:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-11-21 22:20:09,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-11-21 22:20:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2023-11-21 22:20:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583473621] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:20:09,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:20:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 13] total 34 [2023-11-21 22:20:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210755700] [2023-11-21 22:20:09,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:20:09,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 22:20:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 22:20:09,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=826, Unknown=3, NotChecked=180, Total=1122 [2023-11-21 22:20:09,644 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:10,738 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-11-21 22:20:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:20:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-21 22:20:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:10,740 INFO L225 Difference]: With dead ends: 81 [2023-11-21 22:20:10,740 INFO L226 Difference]: Without dead ends: 81 [2023-11-21 22:20:10,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1478, Unknown=3, NotChecked=246, Total=1980 [2023-11-21 22:20:10,742 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 90 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:10,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 243 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 677 Invalid, 0 Unknown, 187 Unchecked, 0.6s Time] [2023-11-21 22:20:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-21 22:20:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-11-21 22:20:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2023-11-21 22:20:10,745 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 36 [2023-11-21 22:20:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:10,746 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2023-11-21 22:20:10,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2023-11-21 22:20:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-21 22:20:10,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:10,747 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:10,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:20:10,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-21 22:20:10,959 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-21 22:20:10,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1513601688, now seen corresponding path program 1 times [2023-11-21 22:20:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754048239] [2023-11-21 22:20:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754048239] [2023-11-21 22:20:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754048239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008782040] [2023-11-21 22:20:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:13,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:13,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce61b82-258f-404f-ae91-712d578b5f2d/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 22:20:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:13,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-21 22:20:13,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:13,925 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:20:13,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-21 22:20:14,080 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-21 22:20:14,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-21 22:20:14,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:20:14,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:20:14,395 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-21 22:20:14,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 22:20:14,495 INFO L378 Elim1Store]: Elim1 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 [2023-11-21 22:20:14,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:20:14,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:20:14,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:20:14,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:20:14,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:20:14,668 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:20:14,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2023-11-21 22:20:14,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-21 22:20:14,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 22:20:14,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-21 22:20:14,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-21 22:20:14,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:20:14,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:20:14,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-11-21 22:20:14,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-21 22:20:15,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:20:15,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-11-21 22:20:15,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-21 22:20:15,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:20:15,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2023-11-21 22:20:15,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:20:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:15,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:20:15,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) .cse0) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< .cse1 v_prenex_11) (< v_prenex_11 0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< .cse1 |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2023-11-21 22:20:15,890 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2083) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (forall ((v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int)) (or (< v_prenex_11 0) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2081) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) v_prenex_11) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) .cse0) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2083) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2081) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) is different from false [2023-11-21 22:20:16,002 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2076 Int) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2083) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_11) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) .cse0) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_11 0)))))) (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2076 Int) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2083) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) is different from false [2023-11-21 22:20:16,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2074 (Array Int Int))) (or (not (= v_ArrVal_2074 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2074 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2075 (Array Int Int))) (or (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2076 Int) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2074) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2083) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2075) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2075 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2075)))))) (forall ((v_ArrVal_2074 (Array Int Int))) (or (forall ((v_ArrVal_2075 (Array Int Int))) (or (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2075 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2075)) (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2076 Int) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2074) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2083) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int)) (or (< v_prenex_11 0) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) .cse4) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2075) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2079) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_11))) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (not (= v_ArrVal_2074 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2074 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2023-11-21 22:20:16,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 164 [2023-11-21 22:20:16,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 142 [2023-11-21 22:20:16,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-11-21 22:20:16,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2023-11-21 22:20:16,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-21 22:20:16,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:20:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-21 22:20:16,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-11-21 22:20:16,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-11-21 22:20:16,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 221 [2023-11-21 22:20:16,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2023-11-21 22:20:16,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 183 [2023-11-21 22:20:16,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2023-11-21 22:20:17,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-11-21 22:20:17,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-21 22:20:17,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:20:17,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-21 22:20:17,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-11-21 22:20:19,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse24 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_2073 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0)))) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (not .cse12))) (let ((.cse6 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse52 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse52 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (.cse18 (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse51 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse51 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse15 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse50 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse14 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse49 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse49 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))) (.cse22 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse48 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0)))) (.cse31 (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse47 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (.cse33 (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse4)) (.cse8 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse46 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse46 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse7 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse45 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse45 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< v_prenex_11 0))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse10 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse44 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse44 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse11 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)) (< v_prenex_11 0))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse9 (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse43 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse43 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) (.cse5 (not .cse2)) (.cse17 (or .cse2 .cse24)) (.cse20 (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse42 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0))))))) (and (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse0 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse0 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (or (and (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) .cse2) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse3 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse4) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse5) (or .cse6 .cse4) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse12 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse13 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) .cse5) (or (and (or .cse14 .cse4) .cse15 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse16 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))))) .cse5) (or .cse6 .cse5) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5) (or .cse12 (let ((.cse21 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0) (= (select (select .cse25 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and .cse17 .cse18 (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse19 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse19 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) .cse20 (or .cse21 .cse2) (or .cse2 (and .cse21 .cse22 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse23 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse23 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse24))))) (or (and (or .cse12 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse26 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse18 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse27 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0)))))) .cse5) (or (and (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse5) (or .cse2 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse28 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse15 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse29 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse14 .cse5) (or .cse2 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse4) (or .cse2 (and (or (and .cse22 .cse24) .cse12) (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse30 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse30 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse31 (or .cse4 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse32 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= (select (select .cse32 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse33)) (or .cse2 (and .cse31 .cse33)) (or (let ((.cse34 (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (< v_prenex_11 0)))) (.cse35 (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse38 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (and (or (and .cse34 .cse35 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse36 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse36 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse37 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) .cse2) .cse8 (or (and .cse7 .cse10 .cse11) .cse5) (or (and .cse34 .cse35) .cse2) .cse9 (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5))) .cse4) (or .cse5 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse39 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))) (or .cse2 (and (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse40 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and .cse17 .cse20) .cse12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse41 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) is different from false [2023-11-21 22:20:21,494 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse24 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_2073 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0)))) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (not .cse12))) (let ((.cse6 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse52 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse52 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (.cse18 (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse51 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse51 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse15 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse50 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse14 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse49 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse49 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))) (.cse22 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse48 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0)))) (.cse31 (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse47 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (.cse33 (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse4)) (.cse8 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse46 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse46 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse7 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse45 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse45 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< v_prenex_11 0))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse10 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse44 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse44 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse11 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)) (< v_prenex_11 0))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse9 (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse43 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse43 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) (.cse5 (not .cse2)) (.cse17 (or .cse2 .cse24)) (.cse20 (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse42 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0))))))) (and (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse0 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse0 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (or (and (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) .cse2) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse3 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse4) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse5) (or .cse6 .cse4) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse12 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse13 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) .cse5) (or (and (or .cse14 .cse4) .cse15 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse16 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))))) .cse5) (or .cse6 .cse5) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5) (or .cse12 (let ((.cse21 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0) (= (select (select .cse25 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and .cse17 .cse18 (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse19 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse19 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) .cse20 (or .cse21 .cse2) (or .cse2 (and .cse21 .cse22 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse23 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse23 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse24))))) (or (and (or .cse12 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse26 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse18 (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0))) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_arrayElimCell_115 Int)) (or (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse27 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0)))))) .cse5) (or (and (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse5) (or .cse2 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse28 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse15 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse29 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse14 .cse5) (or .cse2 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse4) (or .cse2 (and (or (and .cse22 .cse24) .cse12) (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse30 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse30 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse31 (or .cse4 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse32 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= (select (select .cse32 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse33)) (or .cse2 (and .cse31 .cse33)) (or (let ((.cse34 (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (< v_prenex_11 0)))) (.cse35 (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse38 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (and (or (and .cse34 .cse35 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse36 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse36 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse37 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) .cse2) .cse8 (or (and .cse7 .cse10 .cse11) .cse5) (or (and .cse34 .cse35) .cse2) .cse9 (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_11 0) (= v_arrayElimCell_115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5))) .cse4) (or .cse5 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse39 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))) (or .cse2 (and (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse40 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and .cse17 .cse20) .cse12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse41 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) is different from true [2023-11-21 22:20:29,352 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (.cse17 (not .cse8)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (forall ((v_arrayElimCell_115 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse0 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) (or .cse2 (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_arrayElimCell_115) v_prenex_11)) (< v_prenex_11 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115) (= (select (select .cse3 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse4 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse4 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= (select (select .cse5 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_114) v_prenex_11))))) (< v_prenex_11 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115))) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 v_arrayElimCell_115) v_prenex_11)) (< v_prenex_11 0) (= (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115)))) .cse8) (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11))) (< v_prenex_11 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115))) (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_114)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115))) (forall ((v_arrayElimCell_115 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 v_arrayElimCell_114) v_prenex_11)) (= (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_114))))))) (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse11 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse11 v_arrayElimCell_114) v_prenex_11)) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115)))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 v_arrayElimCell_114) v_prenex_11)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_114) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115)))) .cse12) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= (select (select .cse14 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= (select (select .cse14 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_arrayElimCell_114) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11))))))))))) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115))) .cse12) (or .cse2 (let ((.cse19 (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|))) (< v_prenex_11 0)))) (.cse20 (forall ((v_prenex_11 Int)) (or (forall ((v_arrayElimCell_114 Int)) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int))) (or (= (select v_ArrVal_2090 v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114))) (< v_prenex_11 0))))) (and (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_arrayElimCell_115) v_prenex_11)) (= (select v_ArrVal_2090 v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse16 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115))) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11)) (< v_prenex_11 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115))) .cse17) (or .cse8 (and (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse18 v_arrayElimCell_115) v_prenex_11)) (= (select (select .cse18 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< v_prenex_11 0))) .cse19 .cse20 (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< v_prenex_11 0) (forall ((v_arrayElimCell_114 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 v_arrayElimCell_115) v_prenex_11)) (= (select v_ArrVal_2090 v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse21 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) (or (and (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11))) (< v_prenex_11 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115))) (forall ((v_arrayElimCell_115 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 0) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int)) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse22 v_arrayElimCell_115) v_prenex_11)) (= (select v_ArrVal_2090 v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse22 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int)) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 v_arrayElimCell_115) v_prenex_11)) (= (select (select .cse23 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< v_prenex_11 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115)))) .cse17) (or .cse8 (and .cse19 .cse20)) (forall ((v_arrayElimCell_115 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_arrayElimCell_115) v_prenex_11)) (= (select (select .cse24 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< v_prenex_11 0)))))))) (or .cse8 .cse2 (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_114 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (< v_prenex_11 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse8 .cse2 (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int)) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_114) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 v_arrayElimCell_115) v_prenex_11)) (< v_prenex_11 0) (= (select (select .cse25 v_arrayElimCell_114) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_arrayElimCell_115 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse26 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= (select (select .cse27 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)))) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_2073 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse28 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_arrayElimCell_115 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (forall ((v_arrayElimCell_114 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_arrayElimCell_114) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse29 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (< v_prenex_11 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)))) (or .cse2 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) (= (select (select .cse30 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))) .cse8) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse31 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_2090 |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))))) (or .cse8 (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_2090 |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (or .cse17 (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= (select (select .cse32 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse32 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|)))))) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_107 Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse17))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_prenex_11 Int) (v_arrayElimCell_115 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (forall ((v_arrayElimCell_114 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_arrayElimCell_114) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (= (select (select .cse33 v_arrayElimCell_115) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (< v_prenex_11 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse2 (and (or .cse8 (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090) v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2090))) (or (forall ((v_arrayElimCell_108 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))) (= (select (select .cse34 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_54|))))) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_arrayElimCell_114) v_prenex_11)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115)))) .cse8 .cse12) (or (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse36 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse36 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090) v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= (select (select .cse37 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse17 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_54| Int) (v_arrayElimCell_108 Int) (v_ArrVal_2073 (Array Int Int)) (v_arrayElimCell_107 Int)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_54| 0) (= (select (select .cse38 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse38 v_arrayElimCell_107) |v_ULTIMATE.start_main_~ptr~0#1.offset_54|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2080) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_114) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_55| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090) v_arrayElimCell_115) v_prenex_11))) (< v_prenex_11 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115))) (forall ((v_arrayElimCell_115 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115) (forall ((v_prenex_11 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_arrayElimCell_114) v_prenex_11)) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse8 (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_115) v_prenex_11)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0) (= (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_11) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115))))) (forall ((v_arrayElimCell_115 Int)) (or (forall ((v_prenex_11 Int)) (or (forall ((v_ArrVal_2076 Int) (v_ArrVal_2090 (Array Int Int)) (v_arrayElimCell_114 Int) (v_ArrVal_2073 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2076)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2090))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_arrayElimCell_115) v_prenex_11)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_arrayElimCell_114) v_prenex_11))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_11) (< v_prenex_11 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_115)))) .cse12)))) is different from true