./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:30:44,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:30:44,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:30:44,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:30:44,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:30:44,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:30:44,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:30:44,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:30:44,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:30:44,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:30:44,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:30:44,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:30:44,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:30:44,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:30:44,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:30:44,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:30:44,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:30:44,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:30:44,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:30:44,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:30:44,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:30:44,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:30:44,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:30:44,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:30:44,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:30:44,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:30:44,323 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-06 22:30:44,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:30:44,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:30:44,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:30:44,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:30:44,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:30:44,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-06 22:30:45,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:30:45,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:30:45,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-06 22:30:45,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96deb1379/d07e2721ca3243d6b4b6cb9d08d7c9b7/FLAG1be5f838d [2024-11-06 22:30:45,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96deb1379/d07e2721ca3243d6b4b6cb9d08d7c9b7 [2024-11-06 22:30:45,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:30:46,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:30:46,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:30:46,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:30:46,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:30:46,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:45" (1/1) ... [2024-11-06 22:30:46,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54172cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46, skipping insertion in model container [2024-11-06 22:30:46,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:45" (1/1) ... [2024-11-06 22:30:46,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:30:46,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-06 22:30:46,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:30:46,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:30:46,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-06 22:30:46,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:30:46,285 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:30:46,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46 WrapperNode [2024-11-06 22:30:46,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:30:46,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:30:46,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:30:46,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:30:46,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,316 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2024-11-06 22:30:46,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:30:46,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:30:46,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:30:46,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:30:46,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,346 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-06 22:30:46,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:30:46,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:30:46,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:30:46,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:30:46,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (1/1) ... [2024-11-06 22:30:46,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:30:46,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:46,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:30:46,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:30:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-06 22:30:46,408 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-06 22:30:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:30:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:30:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:30:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:30:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:30:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:30:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:30:46,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:30:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:30:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:30:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:30:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:30:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:30:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:30:46,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:30:46,511 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:30:46,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:30:46,527 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-06 22:30:46,664 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-06 22:30:46,664 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:30:46,670 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:30:46,671 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 22:30:46,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:46 BoogieIcfgContainer [2024-11-06 22:30:46,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:30:46,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:30:46,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:30:46,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:30:46,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:30:45" (1/3) ... [2024-11-06 22:30:46,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1029c082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:46, skipping insertion in model container [2024-11-06 22:30:46,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:46" (2/3) ... [2024-11-06 22:30:46,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1029c082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:46, skipping insertion in model container [2024-11-06 22:30:46,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:46" (3/3) ... [2024-11-06 22:30:46,679 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-06 22:30:46,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:30:46,689 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:30:46,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:30:46,728 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3acb48cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:30:46,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:30:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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) [2024-11-06 22:30:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 22:30:46,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:46,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:46,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:46,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 70364748, now seen corresponding path program 1 times [2024-11-06 22:30:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69328994] [2024-11-06 22:30:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69328994] [2024-11-06 22:30:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69328994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:30:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:30:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:30:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552286866] [2024-11-06 22:30:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:30:46,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:30:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:46,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:30:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:30:46,929 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2024-11-06 22:30:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:46,939 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-11-06 22:30:46,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:30:46,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 [2024-11-06 22:30:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:46,944 INFO L225 Difference]: With dead ends: 41 [2024-11-06 22:30:46,944 INFO L226 Difference]: Without dead ends: 18 [2024-11-06 22:30:46,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:30:46,948 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:46,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:30:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-06 22:30:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-06 22:30:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-06 22:30:46,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-11-06 22:30:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:46,971 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-06 22:30:46,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2024-11-06 22:30:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-06 22:30:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 22:30:46,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:46,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:46,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:30:46,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -273185064, now seen corresponding path program 1 times [2024-11-06 22:30:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607940861] [2024-11-06 22:30:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607940861] [2024-11-06 22:30:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607940861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:30:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:30:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:30:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631283879] [2024-11-06 22:30:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:30:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:30:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:30:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:30:47,139 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-06 22:30:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:47,156 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-06 22:30:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:30:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 [2024-11-06 22:30:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:47,158 INFO L225 Difference]: With dead ends: 32 [2024-11-06 22:30:47,158 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 22:30:47,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:30:47,159 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:47,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:30:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 22:30:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-06 22:30:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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) [2024-11-06 22:30:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-06 22:30:47,162 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2024-11-06 22:30:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:47,163 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-06 22:30:47,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-06 22:30:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-06 22:30:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 22:30:47,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:47,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:47,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:30:47,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:47,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783240, now seen corresponding path program 1 times [2024-11-06 22:30:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236852826] [2024-11-06 22:30:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236852826] [2024-11-06 22:30:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236852826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452603894] [2024-11-06 22:30:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:47,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:30:47,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:30:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:47,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 22:30:47,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:47,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452603894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:30:47,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:30:47,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-06 22:30:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463171151] [2024-11-06 22:30:47,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:47,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:30:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:30:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:30:47,438 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:47,491 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-06 22:30:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:30:47,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 [2024-11-06 22:30:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:47,492 INFO L225 Difference]: With dead ends: 39 [2024-11-06 22:30:47,492 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 22:30:47,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:30:47,493 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:47,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:30:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 22:30:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-06 22:30:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-06 22:30:47,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2024-11-06 22:30:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:47,496 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-06 22:30:47,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-06 22:30:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 22:30:47,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:47,497 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:47,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 22:30:47,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:47,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:47,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729048, now seen corresponding path program 2 times [2024-11-06 22:30:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:47,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417220252] [2024-11-06 22:30:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:30:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417220252] [2024-11-06 22:30:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417220252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683421448] [2024-11-06 22:30:48,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:30:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:48,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:30:48,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:30:48,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:30:48,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:30:48,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-06 22:30:48,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:48,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-06 22:30:48,696 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-06 22:30:48,696 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 [2024-11-06 22:30:48,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-06 22:30:48,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-06 22:30:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:48,821 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-06 22:30:48,821 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 1 case distinctions, treesize of input 55 treesize of output 11 [2024-11-06 22:30:48,833 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 [2024-11-06 22:30:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:30:48,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:48,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:48,941 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 [2024-11-06 22:30:48,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:48,949 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 146 treesize of output 144 [2024-11-06 22:30:48,955 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 [2024-11-06 22:30:49,020 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 [2024-11-06 22:30:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:30:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683421448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:30:49,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:30:49,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-06 22:30:49,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573376602] [2024-11-06 22:30:49,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:49,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-06 22:30:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:49,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-06 22:30:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:30:49,174 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:49,514 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-06 22:30:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 22:30:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 22 [2024-11-06 22:30:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:49,515 INFO L225 Difference]: With dead ends: 32 [2024-11-06 22:30:49,515 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 22:30:49,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-06 22:30:49,516 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:49,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:30:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 22:30:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-06 22:30:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-06 22:30:49,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2024-11-06 22:30:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:49,521 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-06 22:30:49,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:30:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-06 22:30:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:30:49,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:49,523 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:49,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:30:49,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:49,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash 625081166, now seen corresponding path program 1 times [2024-11-06 22:30:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:49,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883178351] [2024-11-06 22:30:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:30:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883178351] [2024-11-06 22:30:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883178351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483531047] [2024-11-06 22:30:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:51,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:51,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:51,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:30:51,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:30:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:51,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-06 22:30:51,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:51,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-06 22:30:51,562 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-06 22:30:51,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-06 22:30:51,601 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:30:51,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:30:51,684 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-06 22:30:51,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-06 22:30:51,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-06 22:30:51,782 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 [2024-11-06 22:30:51,863 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-06 22:30:51,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-06 22:30:51,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:51,920 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 42 treesize of output 31 [2024-11-06 22:30:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-06 22:30:51,931 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 43 treesize of output 19 [2024-11-06 22:30:51,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 1 [2024-11-06 22:30:51,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2024-11-06 22:30:51,945 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 [2024-11-06 22:30:52,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-06 22:30:52,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2024-11-06 22:30:52,022 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 67 treesize of output 23 [2024-11-06 22:30:52,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2024-11-06 22:30:52,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2024-11-06 22:30:52,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-06 22:30:52,141 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 35 treesize of output 19 [2024-11-06 22:30:52,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-06 22:30:52,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-06 22:30:52,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:30:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:30:52,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:52,215 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_595) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2024-11-06 22:30:52,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_595) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0))))) is different from false [2024-11-06 22:30:52,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:52,307 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 3006 treesize of output 3004 [2024-11-06 22:30:52,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:52,335 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 2 case distinctions, treesize of input 746 treesize of output 556 [2024-11-06 22:30:52,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:52,357 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 3456 treesize of output 3398 [2024-11-06 22:30:52,370 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 500 treesize of output 484 [2024-11-06 22:30:52,378 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 620 treesize of output 596 [2024-11-06 22:30:52,605 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 431 treesize of output 415 [2024-11-06 22:30:53,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse18 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse23 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse26 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse32 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1))))))) (.cse5 (not .cse19))) (let ((.cse21 (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5)) (.cse22 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))))))) (.cse25 (or .cse19 .cse32)) (.cse2 (not .cse24)) (.cse6 (not .cse26)) (.cse4 (not .cse23))) (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse3 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4 .cse5) (or .cse6 (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse8 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse9 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse9 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse4 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1))))))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse14 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse17 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse19) (or .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse20 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse6 (and .cse21 .cse22) .cse23) (or .cse24 (and .cse21 .cse22 .cse25)) (or .cse26 (and (or (and (or .cse4 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse19 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse30 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse31 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (or .cse32 .cse2) .cse25 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse34 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) .cse23))) (or (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (or .cse6 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))))) .cse4) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse36 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))) .cse5))))) is different from false [2024-11-06 22:30:54,509 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 13 treesize of output 1 [2024-11-06 22:30:54,537 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 13 treesize of output 1 [2024-11-06 22:30:54,557 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 13 treesize of output 1 [2024-11-06 22:30:54,585 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 13 treesize of output 1 [2024-11-06 22:30:54,607 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 13 treesize of output 1 [2024-11-06 22:30:54,616 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 13 treesize of output 1 [2024-11-06 22:30:54,629 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 13 treesize of output 1 [2024-11-06 22:30:54,638 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 13 treesize of output 1 [2024-11-06 22:30:54,649 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 13 treesize of output 1 [2024-11-06 22:30:54,662 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 13 treesize of output 1 [2024-11-06 22:30:54,766 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 13 treesize of output 1 [2024-11-06 22:30:54,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse11 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (.cse8 (not .cse0)) (.cse9 (not .cse17))) (and (or .cse0 .cse1 (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse6 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse1 (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse7 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse7 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse7 v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (or .cse8 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse8 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_595 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) .cse9))) (or .cse0 (and (or (and (forall ((v_ArrVal_578 (Array Int Int))) (or (forall ((v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595))) (or (= (select (select .cse10 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse9)) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse13 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse15 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse1 (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse16 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_prenex_12) 0))))) .cse9) (or .cse17 (and (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse19 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))))) (or .cse17 .cse8 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse21 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44))) .cse1))) (or .cse8 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse23 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse23 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_arrayElimCell_43) v_arrayElimCell_44)) (= (select (select .cse24 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (or (and (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse26 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0))))) .cse9))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_578 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 v_prenex_11) 0)))))) .cse8) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse30 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_prenex_11) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_11) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_11) 0))))))) (or .cse1 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse32 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse32 v_arrayElimCell_43) v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse32 v_prenex_11) 0))))))) .cse9) (or .cse1 (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse33 v_ArrVal_586) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_arrayElimCell_43) v_arrayElimCell_44))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_ArrVal_586) 0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse8)) .cse9)))) is different from false [2024-11-06 22:30:55,115 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-06 22:30:55,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 306 treesize of output 292 [2024-11-06 22:30:55,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:55,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 196 [2024-11-06 22:30:55,141 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 182 treesize of output 176 [2024-11-06 22:30:55,150 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 176 treesize of output 168 [2024-11-06 22:30:55,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-06 22:30:55,330 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 22 treesize of output 20 [2024-11-06 22:30:55,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:55,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 160 [2024-11-06 22:30:55,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:55,940 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-06 22:30:55,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2652 treesize of output 2659 [2024-11-06 22:30:56,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:56,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1560 treesize of output 1552 [2024-11-06 22:30:56,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:56,106 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 2707 treesize of output 2651 [2024-11-06 22:30:56,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:56,216 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 2527 treesize of output 2521 [2024-11-06 22:30:56,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:56,284 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 2456 treesize of output 2446 [2024-11-06 22:30:57,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:30:57,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:30:57,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:57,473 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 85 treesize of output 89 [2024-11-06 22:31:01,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:01,284 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 883 treesize of output 879 [2024-11-06 22:31:02,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:31:02,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:02,837 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-06 22:31:02,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15515 treesize of output 15277 [2024-11-06 22:31:02,864 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:02,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:02,873 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 339 treesize of output 329 [2024-11-06 22:31:02,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:02,890 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 358 treesize of output 350 [2024-11-06 22:31:02,901 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 114 treesize of output 98 [2024-11-06 22:31:02,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-06 22:31:03,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:03,241 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 133 treesize of output 131 [2024-11-06 22:31:03,353 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-06 22:31:03,358 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:03,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:03,418 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-06 22:31:03,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2217 treesize of output 2222 [2024-11-06 22:31:03,470 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 1030 treesize of output 966 [2024-11-06 22:31:03,518 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:03,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:03,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1594 treesize of output 1574 [2024-11-06 22:31:03,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:03,583 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 2063 treesize of output 2017 [2024-11-06 22:31:10,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:10,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:10,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:10,340 INFO L349 Elim1Store]: treesize reduction 50, result has 51.9 percent of original size [2024-11-06 22:31:10,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47929 treesize of output 47458 [2024-11-06 22:31:10,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:10,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:10,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1090 treesize of output 1106 [2024-11-06 22:31:10,569 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-06 22:31:10,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1654 treesize of output 1665 [2024-11-06 22:31:10,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:10,622 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 1230 treesize of output 1206 [2024-11-06 22:31:10,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:10,668 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 1749 treesize of output 1677 [2024-11-06 22:31:11,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:11,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:11,827 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:31:11,827 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 39 treesize of output 51 [2024-11-06 22:31:13,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:13,542 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 16 treesize of output 6 [2024-11-06 22:31:14,227 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-06 22:31:14,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 839 treesize of output 848 [2024-11-06 22:31:14,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:14,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-06 22:31:14,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:14,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-06 22:31:15,099 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 17 treesize of output 13 [2024-11-06 22:31:15,127 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-06 22:31:15,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 992 treesize of output 978 [2024-11-06 22:31:15,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,143 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 134 treesize of output 134 [2024-11-06 22:31:15,149 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 127 treesize of output 121 [2024-11-06 22:31:15,155 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 54 treesize of output 46 [2024-11-06 22:31:15,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-06 22:31:15,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,359 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 52 treesize of output 54 [2024-11-06 22:31:15,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:15,411 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-06 22:31:15,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 997 treesize of output 983 [2024-11-06 22:31:15,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,431 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 155 treesize of output 153 [2024-11-06 22:31:15,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,443 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 137 treesize of output 137 [2024-11-06 22:31:15,450 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 54 treesize of output 46 [2024-11-06 22:31:15,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:15,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,702 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 62 treesize of output 62 [2024-11-06 22:31:15,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:15,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:15,738 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-06 22:31:15,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 1 [2024-11-06 22:31:15,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:15,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:15,771 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2024-11-06 22:31:15,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1700 treesize of output 1690 [2024-11-06 22:31:15,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:15,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 556 treesize of output 558 [2024-11-06 22:31:15,838 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-06 22:31:15,838 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 577 treesize of output 583 [2024-11-06 22:31:15,851 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 624 treesize of output 608 [2024-11-06 22:31:15,866 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 608 treesize of output 592 [2024-11-06 22:31:15,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,932 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 16 treesize of output 6 [2024-11-06 22:31:15,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:15,956 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 26 treesize of output 30 [2024-11-06 22:31:16,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,013 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 26 treesize of output 30 [2024-11-06 22:31:16,061 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-06 22:31:16,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 125 [2024-11-06 22:31:16,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 73 [2024-11-06 22:31:16,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 70 [2024-11-06 22:31:16,367 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 451 treesize of output 445 [2024-11-06 22:31:16,618 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 17 treesize of output 13 [2024-11-06 22:31:16,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:16,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:16,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2024-11-06 22:31:16,635 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 47 treesize of output 43 [2024-11-06 22:31:16,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-11-06 22:31:16,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2024-11-06 22:31:16,655 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 12 treesize of output 8 [2024-11-06 22:31:16,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-06 22:31:16,666 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 17 treesize of output 13 [2024-11-06 22:31:16,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:16,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:16,709 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2024-11-06 22:31:16,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6725 treesize of output 6607 [2024-11-06 22:31:16,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 556 treesize of output 558 [2024-11-06 22:31:16,781 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-06 22:31:16,781 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 577 treesize of output 583 [2024-11-06 22:31:16,795 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 624 treesize of output 608 [2024-11-06 22:31:16,809 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 608 treesize of output 592 [2024-11-06 22:31:16,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:17,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:17,209 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 26 treesize of output 30 [2024-11-06 22:31:17,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 191 [2024-11-06 22:31:17,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:17,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 160 treesize of output 160 [2024-11-06 22:31:17,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-06 22:31:17,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-06 22:31:17,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-06 22:31:17,500 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 468 treesize of output 460 [2024-11-06 22:31:17,602 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 17 treesize of output 13 [2024-11-06 22:31:17,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:31:17,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:17,640 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-06 22:31:17,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 553 treesize of output 563 [2024-11-06 22:31:17,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:17,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:17,668 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 497 treesize of output 487 [2024-11-06 22:31:17,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:17,686 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 632 treesize of output 624 [2024-11-06 22:31:17,699 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 592 treesize of output 576 [2024-11-06 22:31:17,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:17,981 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 34 treesize of output 30 [2024-11-06 22:31:18,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:18,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:18,025 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-11-06 22:31:18,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 131 [2024-11-06 22:31:18,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:18,036 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 146 treesize of output 144 [2024-11-06 22:31:18,042 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 138 treesize of output 132 [2024-11-06 22:31:18,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:18,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:18,191 INFO L349 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2024-11-06 22:31:18,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 7870 treesize of output 7774 [2024-11-06 22:31:18,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:18,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:18,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2292 treesize of output 2274 [2024-11-06 22:31:18,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:18,425 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 2820 treesize of output 2760 [2024-11-06 22:31:18,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:18,480 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 2617 treesize of output 2545 [2024-11-06 22:31:19,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:19,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:19,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:20,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:20,912 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 148 treesize of output 150 [2024-11-06 22:31:21,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:21,468 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 98 treesize of output 94 [2024-11-06 22:31:21,852 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 98 treesize of output 94 [2024-11-06 22:31:48,395 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-06 22:31:48,395 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 148 treesize of output 1 [2024-11-06 22:31:48,752 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-06 22:31:48,752 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 148 treesize of output 1 [2024-11-06 22:31:49,279 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 258 treesize of output 250 [2024-11-06 22:31:49,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:31:49,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:49,754 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-06 22:31:49,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 995 treesize of output 997 [2024-11-06 22:31:49,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:49,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:49,780 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 453 treesize of output 443 [2024-11-06 22:31:49,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:49,795 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 472 treesize of output 464 [2024-11-06 22:31:49,805 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 436 treesize of output 420 [2024-11-06 22:31:49,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-06 22:31:50,012 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 30 treesize of output 26 [2024-11-06 22:31:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:50,034 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-06 22:31:50,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:50,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:50,099 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-06 22:31:50,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 5966 treesize of output 5891 [2024-11-06 22:31:50,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:50,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1530 treesize of output 1510 [2024-11-06 22:31:50,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:31:50,249 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 1715 treesize of output 1669 [2024-11-06 22:31:50,277 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 1542 treesize of output 1478 [2024-11-06 22:31:52,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:52,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-06 22:31:52,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:52,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:52,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:52,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:52,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:31:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-06 22:31:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483531047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:31:54,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:31:54,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 31 [2024-11-06 22:31:54,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202336831] [2024-11-06 22:31:54,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:31:54,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-06 22:31:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:31:54,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-06 22:31:54,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=612, Unknown=9, NotChecked=212, Total=930 [2024-11-06 22:31:54,457 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 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) [2024-11-06 22:31:59,349 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse24 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse26 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse32 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1))))))) (.cse5 (not .cse19))) (let ((.cse21 (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5)) (.cse22 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))))))) (.cse25 (or .cse19 .cse32)) (.cse7 (not .cse26)) (.cse4 (not .cse23)) (.cse2 (not .cse24))) (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse3 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4 .cse5) (= (select .cse6 0) 1) (or .cse7 (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse9 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse9 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse10 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse10 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse4 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1))))))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse15 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse7) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse18 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse19) (or .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse20 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse7 (and .cse21 .cse22) .cse23) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse7 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or .cse24 (and .cse21 .cse22 .cse25)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse5 (or .cse26 (and (or (and (or .cse4 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse19 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse30 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse31 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (or .cse32 .cse2) .cse25 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse34 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) .cse23))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (or .cse7 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))))) .cse4) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse36 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))) .cse5) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20| Int)) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|)))) .cse2)))) is different from true [2024-11-06 22:32:04,136 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse28 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse29 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4)) (.cse14 (not (= .cse29 0))) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse9 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (not (= .cse28 0))) (.cse7 (not .cse2)) (.cse12 (not .cse6))) (and (= (select .cse0 0) 1) (= 1 (select (select |c_#memory_int#1| .cse1) 0)) (or .cse2 .cse3 (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 .cse5 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4) 0) .cse6 (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse7 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse10 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse3 (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse11 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse11 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (or .cse7 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse7 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_595 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) .cse12))) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (or .cse2 (and (or (and (forall ((v_ArrVal_578 (Array Int Int))) (or (forall ((v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595))) (or (= (select (select .cse13 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse12)) .cse14) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse15 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse15 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse17 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))) (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse3 (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse18 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse18 v_prenex_12) 0))))) .cse12) (or .cse6 (and (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse14) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse20 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))))) (or .cse6 .cse7 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse22 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 .cse5 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44))) .cse3))) (or .cse7 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse24 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse24 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 .cse5 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 v_arrayElimCell_43) v_arrayElimCell_44)) (= (select (select .cse25 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) (or (and (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse14) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse27 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0))))) .cse12))) (= .cse28 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= .cse29 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_578 (store (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_prenex_11) 0)))))) .cse7) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))) (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse33 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_prenex_11) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_11) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 (select v_ArrVal_578 .cse9)))))) .cse14) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_578 (store .cse0 .cse9 (select v_ArrVal_578 .cse9)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_prenex_11) 0))))))) (or .cse3 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_arrayElimCell_43) v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_11) 0))))))) .cse12) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20| Int)) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|)))) (or .cse3 (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse36 v_ArrVal_586) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_arrayElimCell_43) v_arrayElimCell_44))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_ArrVal_586) 0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse7)) .cse12)))) is different from true [2024-11-06 22:32:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:04,606 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-06 22:32:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 22:32:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 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) Word has length 25 [2024-11-06 22:32:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:04,607 INFO L225 Difference]: With dead ends: 36 [2024-11-06 22:32:04,607 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:32:04,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=155, Invalid=914, Unknown=11, NotChecked=402, Total=1482 [2024-11-06 22:32:04,610 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:04,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 86 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 179 Unchecked, 0.3s Time] [2024-11-06 22:32:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:32:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-06 22:32:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-06 22:32:04,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2024-11-06 22:32:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:04,621 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-06 22:32:04,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 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) [2024-11-06 22:32:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-06 22:32:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 22:32:04,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:04,622 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:04,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:32:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:04,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2098705491, now seen corresponding path program 1 times [2024-11-06 22:32:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115644646] [2024-11-06 22:32:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115644646] [2024-11-06 22:32:05,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115644646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240485986] [2024-11-06 22:32:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:05,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:05,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:32:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:05,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-06 22:32:05,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:05,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-06 22:32:05,506 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-06 22:32:05,506 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 [2024-11-06 22:32:05,528 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-06 22:32:05,529 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 [2024-11-06 22:32:05,557 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:32:05,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:32:05,608 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-06 22:32:05,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-06 22:32:05,632 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-06 22:32:05,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-06 22:32:05,641 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 41 treesize of output 40 [2024-11-06 22:32:05,674 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 72 treesize of output 18 [2024-11-06 22:32:05,719 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 20 treesize of output 8 [2024-11-06 22:32:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:32:05,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:05,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:05,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-06 22:32:05,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:05,812 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 173 treesize of output 171 [2024-11-06 22:32:05,817 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 172 treesize of output 156 [2024-11-06 22:32:05,850 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 [2024-11-06 22:32:05,853 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 45 treesize of output 37 [2024-11-06 22:32:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 22:32:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240485986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:06,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2024-11-06 22:32:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508794707] [2024-11-06 22:32:06,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 22:32:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:06,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 22:32:06,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-06 22:32:06,053 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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) [2024-11-06 22:32:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:06,422 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-06 22:32:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 22:32:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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) Word has length 26 [2024-11-06 22:32:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:06,423 INFO L225 Difference]: With dead ends: 39 [2024-11-06 22:32:06,423 INFO L226 Difference]: Without dead ends: 33 [2024-11-06 22:32:06,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2024-11-06 22:32:06,424 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:06,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 95 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:32:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-06 22:32:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-06 22:32:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-06 22:32:06,432 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2024-11-06 22:32:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:06,433 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-06 22:32:06,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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) [2024-11-06 22:32:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-06 22:32:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 22:32:06,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:06,433 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:06,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 22:32:06,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-06 22:32:06,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1184035048, now seen corresponding path program 2 times [2024-11-06 22:32:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032475415] [2024-11-06 22:32:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032475415] [2024-11-06 22:32:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032475415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911977541] [2024-11-06 22:32:08,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:32:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:08,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:08,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:32:08,362 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:32:08,363 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:32:08,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-06 22:32:08,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:08,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-06 22:32:08,404 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:32:08,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:32:08,473 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-06 22:32:08,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-06 22:32:08,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-06 22:32:08,557 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 [2024-11-06 22:32:08,646 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-11-06 22:32:08,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-11-06 22:32:08,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:08,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2024-11-06 22:32:08,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-06 22:32:08,793 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:32:08,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2024-11-06 22:32:08,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-06 22:32:08,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2024-11-06 22:32:08,814 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 [2024-11-06 22:32:08,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-06 22:32:08,922 INFO L349 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2024-11-06 22:32:08,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 36 [2024-11-06 22:32:09,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2024-11-06 22:32:09,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 35 [2024-11-06 22:32:09,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-06 22:32:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:09,071 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 42 [2024-11-06 22:32:09,074 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:32:09,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-06 22:32:09,175 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-06 22:32:09,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 55 [2024-11-06 22:32:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:09,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2024-11-06 22:32:09,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-06 22:32:09,394 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-06 22:32:09,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 71 [2024-11-06 22:32:09,400 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 24 treesize of output 19 [2024-11-06 22:32:09,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:09,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:09,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:09,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-06 22:32:09,565 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-06 22:32:09,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 102 [2024-11-06 22:32:09,583 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-06 22:32:09,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 78 [2024-11-06 22:32:09,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-11-06 22:32:09,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-06 22:32:09,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-06 22:32:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:09,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:09,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse5))) (let ((.cse6 (= |c_ULTIMATE.start_main_~head~1#1.base| .cse0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (or (forall ((v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse2 (+ (select v_ArrVal_1096 .cse5) 4))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1096) .cse0) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_1098)) .cse0) .cse2)) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse3) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))) .cse6) (forall ((v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse7 (select v_ArrVal_1096 .cse5))) (let ((.cse8 (+ .cse7 4))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1096) .cse0) .cse8))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse7) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_1098)) .cse0) .cse8)) .cse9) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse9) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (or .cse6 (forall ((v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse11 (+ (select v_ArrVal_1096 .cse5) 4))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_1098)) .cse0) .cse11))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) .cse10) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1096) .cse0) .cse11)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_main_~ptr~0#1.offset|)))) (= .cse10 |c_ULTIMATE.start_main_~head~1#1.base|)))))) (forall ((v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1096 .cse5))) (let ((.cse14 (+ .cse12 4))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset| v_ArrVal_1098)) .cse0) .cse14))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse12) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) .cse13) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1096) .cse0) .cse14)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_main_~ptr~0#1.offset|)))) (= .cse13 |c_ULTIMATE.start_main_~head~1#1.base|)))))))))) is different from false [2024-11-06 22:32:09,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse6 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (select .cse5 .cse6))) (let ((.cse7 (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (forall ((v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1096 .cse6))) (let ((.cse2 (+ .cse3 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| v_ArrVal_1098)) .cse0) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) .cse1) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1096) .cse0) .cse2)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse1) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))))) (or .cse7 (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse9 (+ (select v_ArrVal_1096 .cse6) 4))) (let ((.cse8 (select .cse10 .cse9))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) .cse8) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1096) .cse0) .cse9)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))))) (or .cse7 (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse11 (+ (select v_ArrVal_1096 .cse6) 4))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1096) .cse0) .cse11))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) (select .cse10 .cse11)) .cse12) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse12 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))))) (forall ((v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse15 (select v_ArrVal_1096 .cse6))) (let ((.cse13 (+ .cse15 4))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1096) .cse0) .cse13))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1097) .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| v_ArrVal_1098)) .cse0) .cse13)) .cse14) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse15 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= .cse14 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= v_ArrVal_1096 (store .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))))))))) is different from false [2024-11-06 22:32:10,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse10 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select .cse9 .cse7))) (let ((.cse0 (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7))) (and (or .cse0 (forall ((v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1087 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse9 .cse10 v_ArrVal_1087))) (.cse4 (+ 4 (select v_ArrVal_1096 .cse7)))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_1096)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select .cse2 .cse3) .cse4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1097) .cse5 v_ArrVal_1103) (select (select .cse2 .cse5) .cse4)) (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1096) .cse5) .cse4))))))) (or .cse0 (forall ((v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1087 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse11 (+ 4 (select v_ArrVal_1096 .cse7)))) (let ((.cse12 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1096) .cse5) .cse11))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_1096)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1097) .cse5 v_ArrVal_1103) (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse9 .cse10 v_ArrVal_1087)) .cse5) .cse11)) .cse12)) (= .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1087 Int) (v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse13 (select v_ArrVal_1096 .cse7))) (let ((.cse14 (+ 4 .cse13))) (let ((.cse15 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1096) .cse5) .cse14))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_1096)) (= .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1097) .cse5 v_ArrVal_1103) (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1087) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_1098)) .cse5) .cse14)) .cse15) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1087 Int) (v_ArrVal_1098 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse16 (select v_ArrVal_1096 .cse7))) (let ((.cse17 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1087) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_1098))) (.cse18 (+ 4 .cse16))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_1096 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_ArrVal_1096)) (= .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1097) .cse5 v_ArrVal_1103) (select (select .cse17 .cse5) .cse18)) (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1096) .cse5) .cse18)) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse17 .cse3) .cse18) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))))))) is different from false